Size Ramsey results for the path of order three

DOI10.1007/s00373-021-02398-3zbMath1479.05221OpenAlexW3210893148MaRDI QIDQ2053695

Ingrid Mengersen, Roland Lortz

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02398-3

zbMATH Keywords

pathsize Ramsey numberstaralmost complete graphrestricted size Ramsey numbersmall graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Size Ramsey numbers involving stars
• The size Ramsey number
• Two-edge colorings of graphs with bounded degree in both colors
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey numbers for graphs with five vertices
• Some small ramsey numbers
• The ramsey number r(k₁ + c₄, k₅ − e)
• R(4, 5) = 25
• Size Ramsey numbers for small‐order graphs
• Restricted size Ramsey number for path of order three versus graph of order five
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Size Ramsey results for the path of order three