Unavoidable order-size pairs in hypergraphs -- positive forcing density

DOI10.5070/c63362798arXiv2208.06626OpenAlexW4390104286MaRDI QIDQ6204681

Maria A. Axenovich, Lea Weber, Felix Christian Clemen, József Balogh

Publication date: 2 April 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

forcing densityinduced hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• An exact result for 3-graphs
• Unavoidable patterns
• Systems of sets possessing the T-property
• Induced subgraphs of given sizes
• On extremal problems of graphs and generalized graphs
• Sur une propriété des nombres tétraédraux
• Partition relations for cardinal numbers
• Absolutely avoidable order-size pairs for induced subgraphs

This page was built for publication: Unavoidable order-size pairs in hypergraphs -- positive forcing density