A Kruskal-Katona type theorem for graphs

DOI10.1016/j.jcta.2009.04.003zbMath1230.05174arXiv1010.2288OpenAlexW2057231118MaRDI QIDQ966066

Andrew Frohmader

Publication date: 27 April 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

\(f\)-vectorclique complexface numbersKruskal-Katona

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)

Related Items

Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ Many Cliques in Bounded-Degree Hypergraphs ⋮ Shadows of ordered graphs ⋮ \(b\)-vectors of chordal graphs ⋮ Clique vectors of \(k\)-connected chordal graphs ⋮ The Kruskal-Katona function, Conway sequence, Takagi curve, and Pascal adic ⋮ Unified approach to the generalized Turán problem and supersaturation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Face vectors of flag complexes
• Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
• Intersection properties of boxes. I: An upper-bound theorem
• The maximum number of triangles in a \(K_4\)-free graph
• A new Turán-type theorem for cliques in graphs
• Combinatorics and commutative algebra.
• Shadows of colored complexes.