New lower bounds on the size-Ramsey number of a path

DOI10.37236/9804zbMath1481.05106arXiv1909.06354OpenAlexW4210301198MaRDI QIDQ2073313

Deepak Bal, Louis DeBiasio

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

2-coloringsize-Ramsey number

Mathematics Subject Classification ID

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

Related Items (2)

Short proofs for long induced paths ⋮ On the restricted size Ramsey number for a pair of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On linear k-arboricity
• On the combinatorial problems which I would most like to see solved
• Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
• Note on the multicolour size-Ramsey number for paths
• Size-Ramsey numbers of cycles versus a path
• Remarks on the size Ramsey number of graphs
• The integrity of a cubic graph
• An analogue of the Erdős-Gallai theorem for random graphs
• Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
• Long cycles in locally expanding graphs, with applications
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• Introduction to Random Graphs
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• On the Edge-Expansion of Graphs
• On size Ramsey number of paths, trees, and circuits. I
• On some Multicolor Ramsey Properties of Random Graphs
• 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: New lower bounds on the size-Ramsey number of a path