On some three-color Ramsey numbers for paths

DOI10.1016/J.DAM.2015.11.002zbMath1333.05196arXiv1207.5851OpenAlexW1510359142MaRDI QIDQ266822

Janusz Dybizbański, Tomasz Dzido, Stanislaw P. Radziszowski

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

path graphthree-color Ramsey number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

Ramsey and Gallai-Ramsey numbers for the union of paths and stars

Cites Work

• The 3-colored Ramsey number of even cycles
• On the combinatorial problems which I would most like to see solved
• Maximal cycles in graphs
• Path Ramsey numbers in multicolorings
• Three-color Ramsey numbers for paths
• On maximal paths and circuits of graphs
• An extremal problem for paths in bipartite graphs
• Maximal circuits of graphs. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some three-color Ramsey numbers for paths