Unavoidable stars in 3-graphs

DOI10.1016/0097-3165(83)90011-0zbMath0538.05049OpenAlexW2061954628MaRDI QIDQ793053

Fan R. K. Chung

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90011-0

zbMATH Keywords

extremal hypergraph problemsDelta-systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (6)

Universal and unavoidable graphs ⋮ The maximum number of edges in a 3-graph not containing a given star ⋮ Turán numbers of sunflowers ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ Unavoidable hypergraphs ⋮ Extremal subgraphs for two graphs

This page was built for publication: Unavoidable stars in 3-graphs