Tight paths in convex geometric hypergraphs
From MaRDI portal
Publication:5126752
DOI10.19086/aic.12044zbMath1450.05059arXiv2002.09457OpenAlexW3006967677MaRDI QIDQ5126752
Dhruv Mubayi, Tao Jiang, Jacques Verstraete, Alexandr V. Kostochka, Zoltan Fueredi
Publication date: 20 October 2020
Published in: Advances in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.09457
Related Items (8)
Extremal problems for pairs of triangles ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Saturation problems in convex geometric hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ Partitioning ordered hypergraphs ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs
This page was built for publication: Tight paths in convex geometric hypergraphs
