The multipartite Ramsey number for the 3-path of length three
From MaRDI portal
Publication:1709522
DOI10.1016/J.DISC.2018.01.015zbMATH Open1383.05207arXiv1706.08937OpenAlexW2963205369WikidataQ130203020 ScholiaQ130203020MaRDI QIDQ1709522FDOQ1709522
Authors: Tomasz Łuczak, Joanna Polcyn
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: We study the Ramsey number for the 3-path of length three and colors and show that , for some explicit constant .
Full work available at URL: https://arxiv.org/abs/1706.08937
Recommendations
Distance in graphs (05C12) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)
Cites Work
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
- Turán numbers for 3-uniform linear paths of length 3
- The 3-colored Ramsey number for a 3-uniform loose path of length 3
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- Generalised Ramsey numbers for small graphs
- On the multicolor Ramsey number for 3-paths of length three
- One more Turán number and Ramsey number for the loose 3-uniform path of length three
Cited In (13)
- The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2)
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3
- Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
- On multicolor Ramsey numbers for loose \(k\)-paths of length three
- Constrained Ramsey numbers for the loose path, cycle and star
- Turán and Ramsey numbers for 3‐uniform minimal paths of length 4
- Multipartite Ramsey number of complete graphs versus matchings
- Ramsey numbers for the path with three edges
- Paths in hypergraphs: a rescaling phenomenon
- Tripartite Ramsey numbers for paths
- On the multicolor Ramsey number for 3-paths of length three
- \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
This page was built for publication: The multipartite Ramsey number for the 3-path of length three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709522)