Hypergraphs Not Containing a Tight Tree with a Bounded Trunk

Authors:
  • ZFZoltán Füredi
    Zoltán Füredi
  • TJTao Jiang
    Tao Jiang
  • AKAlexandr Kostochka
    Alexandr Kostochka
  • DMDhruv Mubayi
    Dhruv Mubayi
  • JVJacques Verstraëte
    Jacques Verstraëte

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...
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: