Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
Authors:
- Zoltán FürediZFZoltán Füredi
- Tao JiangTJTao Jiang
- Alexandr KostochkaAKAlexandr Kostochka
- Dhruv MubayiDMDhruv Mubayi
- Jacques VerstraëteJVJacques Verstraëte
- 1 January 2019
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 33 (2) , 862-873
Abstract
An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every edge $e$ contains a vertex $v$ that does not belong to any preceding edge and the set $e-v$ lies in some prec...
Keywords
All Related Versions
Funding Information
- National Science Foundation (DMS-1400249, DMS-1600592, DMS-1300138, DMS-1556524)
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal (K116769)
- Russian Foundation for Basic Research (15-01-05867, 16-01-00499)
- Simons Foundation (317487)
This publication has 11 references indexed in Scilit:
- The Junta Method in Extremal Hypergraph Theory and Chvátal's ConjectureElectronic Notes in Discrete Mathematics, 2017
- Turán problems and shadows II: TreesJournal of Combinatorial Theory, Series B, 2017
- Improved bounds for Erdősʼ Matching ConjectureJournal of Combinatorial Theory, Series A, 2013
- Turán Numbers for Disjoint Copies of GraphsGraphs and Combinatorics, 2011
- The Erdős‐Sós Conjecture for trees of diameter fourJournal of Graph Theory, 2005
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- Intersection theorems for systems of finite setsActa Mathematica Hungarica, 1964
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959