Size-Ramsey numbers of cycles versus a path

DOI10.1016/j.disc.2018.04.008zbMath1387.05163arXiv1608.06533OpenAlexW2964011304MaRDI QIDQ1752689

Farideh Khoeini, Paweł Prałat, Andrzej Dudek

Publication date: 24 May 2018

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

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

zbMATH Keywords

size-Ramsey numbers

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

On the size Ramsey number of all cycles versus a path, On the restricted size Ramsey number involving a path \(P_3\), Perfect matchings and Hamiltonian cycles in the preferential attachment model, New lower bounds on the size-Ramsey number of a path

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• The size Ramsey number of a directed path
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On the combinatorial problems which I would most like to see solved
• Long cycles in subgraphs of (pseudo)random directed graphs
• On size Ramsey number of paths, trees, and circuits. I
• Paths in graphs
• The Induced Size-Ramsey Number of Cycles
• On the Size-Ramsey Number of Cycles
• 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