Paths in hypergraphs: a rescaling phenomenon
From MaRDI portal
Publication:5244124
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 .
Recommendations
Cites work
- A tale of stars and cliques
- Forbidding just one intersection
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- On the Minimal Density of Triangles in Graphs
- Set Systems with No Singleton Intersection
- The clique density theorem
- The multipartite Ramsey number for the 3-path of length three
- Turán numbers for 3-uniform linear paths of length 3
- Turán problems and shadows. I: Paths and cycles
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)