Induced Turán Numbers

DOI10.1017/S0963548317000542zbMath1387.05123arXiv1610.06521MaRDI QIDQ4643317

Rodrigo M. Zhou, Po-Shen Loh, Craig Timmons, Michael Tait

Publication date: 24 May 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06521

zbMATH Keywords

Kovári-Sós-Turán theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ Degenerate Turán problems for hereditary properties ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ Class Ramsey numbers involving induced graphs ⋮ Induced Turán problems and traces of hypergraphs ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ On induced saturation for paths ⋮ Large cliques in hypergraphs with forbidden substructures ⋮ Some sharp results on the generalized Turán numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Ramsey multiplicity of complete graphs
• Set families with forbidden subposets
• Excluding induced subgraphs. II: Extremal graphs
• Large cliques in \(C_4\)-free graphs
• Ramsey-type theorems
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Pentagons vs. triangles
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Bounds on the number of complete subgraphs
• The Ramsey numbers r(P\(_m\),K\(_n\))
• Compactness results in extremal graph theory
• The speed of hereditary properties of graphs
• What we know and what we do not know about Turán numbers
• Large \(2P_ 3\)-free graphs with bounded degree
• New asymptotics for bipartite Turán numbers
• On the number of pentagons in triangle-free graphs
• On extremal problems of graphs and generalized graphs
• The Erdös-Hajnal Conjecture-A Survey
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• Set Families With a Forbidden Induced Subposet
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Dependent random choice
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• Large P₄‐free graphs with bounded degree
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the structure of linear graphs
• Ramsey-Turán theory
• Asymptotic upper bounds for Ramsey functions
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Induced Turán Numbers