Paths in hypergraphs: a rescaling phenomenon
From MaRDI portal
Publication:5244124
DOI10.1137/17M1122323zbMATH Open1427.05151arXiv1706.08465WikidataQ126769476 ScholiaQ126769476MaRDI QIDQ5244124FDOQ5244124
Authors: Tomasz Łuczak, Joanna Polcyn
Publication date: 20 November 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Abstract: Let denote the loose -path of length and let define as the minimum value of over all -free -graphs with vertices and edges. In the paper we study the behavior of and and characterize the structure of extremal hypergraphs. In particular, it is shown that when the value of each of these functions drops down from to .
Full work available at URL: https://arxiv.org/abs/1706.08465
Recommendations
Cites Work
- Forbidding just one intersection
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Turán numbers for 3-uniform linear paths of length 3
- Turán problems and shadows. I: Paths and cycles
- The clique density theorem
- On the Minimal Density of Triangles in Graphs
- Set Systems with No Singleton Intersection
- The multipartite Ramsey number for the 3-path of length three
- A tale of stars and cliques
Cited In (2)
This page was built for publication: Paths in hypergraphs: a rescaling phenomenon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244124)