Unavoidable stars in 3-graphs

DOI10.1016/0097-3165(83)90011-0zbMATH Open0538.05049OpenAlexW2061954628MaRDI QIDQ793053FDOQ793053

Authors: Fan 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

Recommendations

• The maximum number of edges in a 3-graph not containing a given star
• A structural result for 3-graphs
• On unavoidable hypergraphs
• Erdős--Ko--Rado for three sets
• The maximum size of 3-wise intersecting and 3-wise union families

zbMATH Keywords

extremal hypergraph problemsDelta-systems

Mathematics Subject Classification ID

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

Cited In (10)

• Unavoidable hypergraphs
• The maximum number of edges in a 3-graph not containing a given star
• Light 3-stars in embedded graphs
• Soft 3-stars in sparse plane graphs
• Uniform Star-factors of Graphs with Girth Three
• Universal and unavoidable graphs
• Extremal subgraphs for two graphs
• A structural result for 3-graphs
• Turán numbers of sunflowers
• The maximum number of triangles in \(F_k\)-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793053)