Ramsey numbers of some bipartite graphs versus complete graphs

DOI10.1007/S00373-010-0959-0zbMath1234.05161OpenAlexW2002645285MaRDI QIDQ659665

Michael Salerno, Tao Jiang

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0959-0

zbMATH Keywords

Ramsey numberIndependence number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)

Related Items (2)

Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs ⋮ Lower bounds for independence numbers of some locally sparse graphs

Cites Work

• Unnamed Item
• On a class of degenerate extremal graph problems
• Asymptotic lower bounds for Ramsey functions
• Ramsey numbers involving large dense graphs and bipartite Turán numbers
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Coloring graphs with sparse neighborhoods
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• E ₁₁ and M theory
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• On cycle—Complete graph ramsey numbers
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t
• A note on odd cycle-complete graph Ramsey numbers

This page was built for publication: Ramsey numbers of some bipartite graphs versus complete graphs