Mono-multi bipartite Ramsey numbers, designs, and matrices

DOI10.1016/j.jcta.2005.07.003zbMath1091.05068OpenAlexW2054792905MaRDI QIDQ817616

András Gyárfás, Richard H. Schelp, Jenő Lehel, Paul N. Balister

Publication date: 16 March 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.07.003

zbMATH Keywords

Ramsey theorymono-multicolored bipartite graphsrainbow matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Ramsey theory (05D10)

Related Items

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 subgraphs ⋮ Constrained Ramsey Numbers ⋮ Constrained Ramsey Numbers ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs

Cites Work

• Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
• Maximum degree and fractional matchings in uniform hypergraphs
• Bipartite rainbow Ramsey numbers.
• Constrained Ramsey numbers of graphs
• An Upper Bound for Constrained Ramsey Numbers
• A Theorem on Coloring the Lines of a Network
• A Combinatorial Theorem
• Generalizations of some Ramsey-type theorems for matchings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mono-multi bipartite Ramsey numbers, designs, and matrices