On unavoidable hypergraphs

DOI10.1002/JGT.3190110215MaRDI QIDQ5203064zbMATH OpenOpenAlexFDO

Authors Fan Chung, P. Erdős

Publication date 1987

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190110215

zbMATH Keywords

edgesunavoidable hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Unavoidable hypergraphs
• On unavoidable graphs
• 3-uniform hypergraphs avoiding a given odd cycle
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On universal hypergraphs

Cited in

(12)

• Unavoidable hypergraphs
• The maximum number of edges in a 3-graph not containing a given star
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• What must be contained in every oriented k-uniform hypergraph
• Computing maximum unavoidable subgraphs using SAT solvers
• On unavoidable graphs
• Absolutely avoidable order-size pairs in hypergraphs
• Unavoidable stars in 3-graphs
• Universal and unavoidable graphs
• The Algorithmic Aspects of Uncrowded Hypergraphs
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Turán numbers of sunflowers

This page was built for publication: On unavoidable hypergraphs

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