2007
DOI: 10.1016/j.disc.2006.07.031
|View full text |Cite
|
Sign up to set email alerts
|

New exact values of the maximum size of graphs free of topological complete subgraphs

Abstract: The extremal number ex(n; T K p ) denotes the maximum number of edges of a graph of order n containing no topological complete graph T K p as a subgraph. In this paper we give the exact value of the extremal number ex(n; T K p ) for (7n + 7)/12 p < (2n + 1)/3 provided that n − p 15. Furthermore, we find the corresponding extremal graphs for n − p 17.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…[4]) devoted to this subject and the contributions on this topic (cf. [5,9,14,19,20,22])). The second was stated by Zarankiewicz (cf.…”
Section: Introductionmentioning
confidence: 99%
“…[4]) devoted to this subject and the contributions on this topic (cf. [5,9,14,19,20,22])). The second was stated by Zarankiewicz (cf.…”
Section: Introductionmentioning
confidence: 99%