Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
From MaRDI portal
Publication:1567606
DOI10.1016/S0012-365X(99)00399-4zbMath0953.05050OpenAlexW2067803318MaRDI QIDQ1567606
Yuming Zhang, Yair Caro, Yusheng Li, Cecil C. Rousseau
Publication date: 29 January 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00399-4
Related Items (15)
A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs ⋮ Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on pseudorandom Ramsey graphs ⋮ Unnamed Item ⋮ Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques ⋮ Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs ⋮ Ramsey numbers of some bipartite graphs versus complete graphs ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ The early evolution of the \(H\)-free process ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ The Erdős-Hajnal conjecture for three colors and triangles
This page was built for publication: Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
