Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs

DOI10.1016/j.disc.2020.112162zbMath1455.05075OpenAlexW3088390970MaRDI QIDQ2219955

Yusheng Li, Meng Liu

Publication date: 21 January 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112162

zbMATH Keywords

Ramsey numberasymptotic boundbipartite Ramsey numberquasi-random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

On the parameterized complexity of the acyclic matching problem

Cites Work

• Unnamed Item
• Counting trees in graphs
• Ramsey numbers involving graphs with large degrees
• The early evolution of the \(H\)-free process
• A note on the independence number of triangle-free graphs
• A Ramsey problem of Harary on graphs with prescribed size
• On the second eigenvalue of a graph
• Asymptotic lower bounds for Ramsey functions
• Polarities and \(2k\)-cycle-free graphs
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Tight estimates for eigenvalues of regular graphs
• On book-complete graph Ramsey numbers
• Multicolor Ramsey numbers via pseudorandom graphs
• Sharp bounds for some multicolour Ramsey numbers
• Asymptotic bounds for bipartite Ramsey numbers

This page was built for publication: Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs