| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512163 | Discrete Mathematics | 2005 | 9 Pages |
Abstract
We consider the following similar modification of Turán's theorem. Let t and n be positive integers with n⩾t⩾2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,t,t as a subgraph. We solve it for n=3t.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ervin GyÅri, Yoomi Rho,