Size Ramsey numbers for some regular graphs

DOI10.1016/j.disc.2008.11.011zbMath1186.05084OpenAlexW2160990703MaRDI QIDQ5902339

Halina Bielak

Publication date: 15 December 2009

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

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

zbMATH Keywords

regular graphsize Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (2)

On the restricted size Ramsey number involving a path \(P_3\) ⋮ The connected size Ramsey number for matchings versus small disconnected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• The size Ramsey number
• On bounds for size Ramsey numbers of a complete tripartite graph
• Remarks on the size Ramsey number of graphs
• The size Ramsey number of a complete bipartite graph
• The size Ramsey number of trees with bounded degree
• On size Ramsey number of paths, trees, and circuits. I
• The size-Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree
• Size Ramsey numbers of stars versus 3-chromatic graphs

This page was built for publication: Size Ramsey numbers for some regular graphs