Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization
From MaRDI portal
Publication:402461
DOI10.1016/J.EJC.2014.02.007zbMath1297.05158OpenAlexW72271495MaRDI QIDQ402461
Jian Shen, Yusheng Li, Qizhong Lin
Publication date: 28 August 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.02.007
Related Items (1)
Cites Work
- Lower bounds for Ramsey numbers of \(K_n\) with a small subgraph removed
- Ramsey goodness and beyond
- An improvement to Mathon's cyclotomic Ramsey colorings
- Lower bounds for Ramsey numbers and association schemes
- Strongly regular graphs and finite Ramsey theory
- On finite Ramsey numbers
- Ramsey's theorem - a new lower bound
- An upper bound for Ramsey numbers.
- Tidier examples for lower bounds on diagonal Ramsey numbers
- On book-complete graph Ramsey numbers
- Three-color Ramsey numbers of \(K _{n }\) dropping an edge
- Bounds for Ramsey numbers of complete graphs dropping an edge
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- A note on Ramsey numbers for books
- The ramsey number of k5 - e
- On ramsey numbers for books
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Some remarks on the theory of graphs
- Quasi-random graphs
This page was built for publication: Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization
