Bipartite rainbow Ramsey numbers.

DOI10.1016/S0012-365X(03)00154-7zbMath1036.05032OpenAlexW2056838769MaRDI QIDQ1426110

Linda Eroh, Ortrud R. Oellermann

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00154-7

zbMATH Keywords

bipartite graphcoloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (8)

Constrained Ramsey numbers of graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Bounds for bipartite rainbow Ramsey numbers ⋮ Constrained Ramsey numbers for the loose path, cycle and star ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Complete bipartite graphs without small rainbow stars ⋮ Complete bipartite graphs without small rainbow subgraphs ⋮ Mono-multi bipartite Ramsey numbers, designs, and matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local \(k\)-colorings of graphs and hypergraphs
• Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
• On multicolor Ramsey numbers for complete bipartite graphs
• Path-path Ramsey type numbers for the complete bipartite graph
• Bipartite Ramsey numbers and Zarankiewicz numbers
• Star-path bipartite Ramsey numbers
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• A Ramsey-type problem in directed and bipartite graphs
• A bipartite Ramsey problem and the Zarankiewicz numbers
• Generalizations of some Ramsey-type theorems for matchings

This page was built for publication: Bipartite rainbow Ramsey numbers.