Author:
LOH PO-SHEN,TAIT MICHAEL,TIMMONS CRAIG,ZHOU RODRIGO M.
Abstract
The classical Kővári–Sós–Turán theorem states that ifGis ann-vertex graph with no copy ofKs,tas a subgraph, then the number of edges inGis at mostO(n2−1/s). We prove that if one forbidsKs,tas aninducedsubgraph, and also forbidsanyfixed graphHas a (not necessarily induced) subgraph, the same asymptotic upper bound still holds, with different constant factors. This introduces a non-trivial angle from which to generalize Turán theory to induced forbidden subgraphs, which this paper explores. Along the way, we derive a non-trivial upper bound on the number of cliques of fixed order in aKr-free graph with no induced copy ofKs,t. This result is an induced analogue of a recent theorem of Alon and Shikhelman and is of independent interest.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference37 articles.
1. Sós V. T. (1969) On extremal problems in graph theory. In Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach, NY, pp. 407–410.
2. What we know and what we do not know about Turán numbers
3. Excluding Induced Subgraphs III: A General Asymptotic
4. Excluding induced subgraphs II: extremal graphs
5. Excluding induced subgraphs: quadrilaterals
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献