Bounds on Ramsey numbers of certain complete bipartite graphs

DOI10.1007/BF03322761zbMath1009.05100MaRDI QIDQ1601402

Ingrid Mengersen, Roland Lortz

Publication date: 6 August 2002

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

zbMATH Keywords

Ramsey numberscomplete bipartite graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (3)

All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs

Cites Work

• On multicolor Ramsey numbers for complete bipartite graphs
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Off‐diagonal and asymptotic results on the Ramsey number r(K_2,m,K_2,n)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on Ramsey numbers of certain complete bipartite graphs