Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs

DOI10.1002/jgt.21771zbMath1311.05121arXiv1201.2123OpenAlexW2172043456WikidataQ114236176 ScholiaQ114236176MaRDI QIDQ2922214

Dhruv Mubayi, John Lenz

Publication date: 9 October 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.2123

zbMATH Keywords

Ramsey theorygraph eigenvaluesgraph spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Generalized Ramsey theory (05C55)

Related Items (3)

Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\) ⋮ Cayley sum graphs and their applications to codebooks ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS

Cites Work

• Ramsey numbers of some bipartite graphs versus complete graphs
• New lower bounds for Ramsey numbers of graphs and hypergraphs
• Some colouring problems for Paley graphs
• On the independence number of random graphs
• The early evolution of the \(H\)-free process
• On the spectrum of projective norm-graphs
• A note on Ramsey numbers
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• On generalized Ramsey theory: The bipartite case
• New asymptotics for bipartite Turán numbers
• Sharp bounds for some multicolour Ramsey numbers
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs