The vertex size-Ramsey number

DOI10.1016/J.DISC.2016.02.001zbMath1333.05195OpenAlexW2273961619MaRDI QIDQ267205

Linda Lesniak, Andrzej Dudek

Publication date: 8 April 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.001

zbMATH Keywords

Ramsey numbersvertex colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse partition universal graphs for graphs of bounded degree
• Degree Ramsey numbers for cycles and blowups of trees
• Expanding graphs contain all small trees
• The size Ramsey number
• A Ramsey type problem concerning vertex colourings
• Large bounded degree trees in expanding graphs
• Tree embeddings
• On size Ramsey number of paths, trees, and circuits. I
• The Induced Size-Ramsey Number of Cycles
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• The size‐Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree

This page was built for publication: The vertex size-Ramsey number