Hypergraphs Not Containing a Tight Tree with a Bounded Trunk

DOI10.1137/17M1160926zbMath1419.05158arXiv1712.04081OpenAlexW2963356543MaRDI QIDQ5232133

Dhruv Mubayi, Jacques Verstraete, Tao Jiang, Alexandr V. Kostochka, Zoltan Fueredi

Publication date: 29 August 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphKalai's conjecturetight tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (3)

Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2

Cites Work

• Unnamed Item
• Unnamed Item
• Turán problems and shadows. II: Trees
• Improved bounds for Erdős' matching conjecture
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• Exact solution of some Turán-type problems
• The junta method in extremal hypergraph theory and Chvátal's conjecture
• A note on traces of set families
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• On maximal paths and circuits of graphs
• Tight paths in convex geometric hypergraphs
• The Erdős‐Sós Conjecture for trees of diameter four
• Intersection theorems for systems of finite sets
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: Hypergraphs Not Containing a Tight Tree with a Bounded Trunk