The multipartite Ramsey number for the 3-path of length three

DOI10.1016/J.DISC.2018.01.015MaRDI QIDQ1709522zbMATH OpenOpenAlexWikidataFDO

Authors Tomasz Łuczak, Joanna Polcyn

Publication date 5 April 2018

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphspathsRamsey number

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Abstract: We study the Ramsey number for the 3-path of length three and $n$ colors and show that $R(P_3^3;n)lelambd{a}_{0}n+7sqrtn$, for some explicit constant $lambd{a}_0=1.97466dots$.

Recommendations

• On the multicolor Ramsey number for 3-paths of length three
• On three-color Ramsey number of paths
• On Multicolor Ramsey Numbers of Triple System Paths of Length 3
• The 3-colored Ramsey number for a 3-uniform loose path of length 3
• On multicolor Ramsey numbers for loose \(k\)-paths of length three

Cites work

• Exact solution of the hypergraph Turán problem for k-uniform linear paths
• Generalised Ramsey numbers for small graphs
• Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
• 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
• Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
• The 3-colored Ramsey number for a 3-uniform loose path of length 3
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• Turán numbers for 3-uniform linear paths of length 3

Cited in

(13)

• Ramsey numbers for the path with three edges
• \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
• On multicolor Ramsey numbers for loose \(k\)-paths of length three
• Tripartite Ramsey numbers for paths
• Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
• On the multicolor Ramsey number for 3-paths of length three
• Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
• Paths in hypergraphs: a rescaling phenomenon
• 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
• The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2)
• On Multicolor Ramsey Numbers of Triple System Paths of Length 3

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)