Paths in Hypergraphs: A Rescaling Phenomenon

DOI10.1137/17M1122323zbMath1427.05151arXiv1706.08465WikidataQ126769476 ScholiaQ126769476MaRDI QIDQ5244124

Joanna Polcyn, Tomasz Łuczak

Publication date: 20 November 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.08465

zbMATH Keywords

pathshypergraphstransition phenomenon

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (2)

A tale of stars and cliques ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3

Cites Work

• Turán numbers for 3-uniform linear paths of length 3
• The clique density theorem
• Turán problems and shadows. I: Paths and cycles
• Forbidding just one intersection
• A tale of stars and cliques
• The multipartite Ramsey number for the 3-path of length three
• 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

This page was built for publication: Paths in Hypergraphs: A Rescaling Phenomenon