The size-Ramsey number of 3-uniform tight paths

DOI10.19086/AIC.24581zbMath1477.05120arXiv1907.08086OpenAlexW3167724850MaRDI QIDQ5162869

Shoham Letzter, Yoshiharu Kohayakawa, Jie Han, Olaf Parczyk, Guilherme Oliveira Mota

Publication date: 5 November 2021

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphtight pathsize-Ramsey number

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

The size‐Ramsey number of cubic graphs

Cites Work

• Unnamed Item
• The size Ramsey number of a directed path
• Explicit construction of linear sized tolerant networks
• On the combinatorial problems which I would most like to see solved
• The multicolour size-Ramsey number of powers of paths
• On the Size-Ramsey Number of Tight Paths
• On size Ramsey number of paths, trees, and circuits. I
• The size‐Ramsey number of powers of paths
• On some Multicolor Ramsey Properties of Random Graphs
• On the Size‐Ramsey Number of Hypergraphs
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• Path Ramsey Number for Random Graphs

This page was built for publication: The size-Ramsey number of 3-uniform tight paths