Ramsey numbers of large books
From MaRDI portal
Publication:6081893
DOI10.1002/jgt.22815zbMath1522.05290arXiv2103.05814OpenAlexW4213286980WikidataQ114236138 ScholiaQ114236138MaRDI QIDQ6081893
Xun Chen, Chunlin You, Qizhong Lin
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05814
Association schemes, strongly regular graphs (05E30) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
New upper bounds for Ramsey numbers of books ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
Cites Work
- Lower bounds for Ramsey numbers and association schemes
- Strongly regular graphs and finite Ramsey theory
- On finite Ramsey numbers
- The size Ramsey number
- Books in graphs
- Large generalized books are \(p\)-good
- On book-complete graph Ramsey numbers
- Ramsey numbers of books and quasirandomness
- Strongly regular graphs, partial geometries and partially balanced designs
- A note on Ramsey numbers for books
- On ramsey numbers for books
- Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
- The Ramsey number of books
- Book Ramsey Numbers and Quasi-Randomness
- Book Ramsey numbers. I
- Large Book-Cycle Ramsey Numbers
- Efficient testing of large graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ramsey numbers of large books