Note on the multicolour size-Ramsey number for paths

zbMath1395.05179arXiv1806.08885MaRDI QIDQ1671658

Andrzej Dudek, Paweł Prałat

Publication date: 7 September 2018

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

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10)

Related Items (7)

The size‐Ramsey number of short subdivisions ⋮ The multicolour size-Ramsey number of powers of paths ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Ordered size Ramsey number of paths ⋮ New lower bounds on the size-Ramsey number of a path ⋮ The multicolor size-Ramsey numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The size Ramsey number of a directed path
• On the combinatorial problems which I would most like to see solved
• The size Ramsey number
• Long cycles in locally expanding graphs, with applications
• Introduction to Random 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: Note on the multicolour size-Ramsey number for paths