The size Ramsey number of a complete bipartite graph

DOI10.1016/0012-365X(93)90521-TzbMath0778.05059OpenAlexW2037949852MaRDI QIDQ2366025

Paul Erdős, Cecil C. Rousseau

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90521-t

zbMATH Keywords

lower boundcomplete bipartite graphssize Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (8)

Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ On bounds for size Ramsey numbers of a complete tripartite graph ⋮ The Induced Size-Ramsey Number of Cycles ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Size Ramsey numbers for some regular graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ Size bipartite Ramsey numbers

Cites Work

• The size Ramsey number
• Unnamed Item

This page was built for publication: The size Ramsey number of a complete bipartite graph