New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
From MaRDI portal
Publication:2057608
DOI10.1016/j.dam.2021.10.023zbMath1479.05217arXiv2107.04460OpenAlexW3216215526MaRDI QIDQ2057608
Jan Goedgebeur, Steven Van Overberghe
Publication date: 7 December 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.04460
Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph designs and isomorphic decomposition (05C51)
Uses Software
Cites Work
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- On the Ramsey number \(R(4,6)\)
- Locally polar spaces and related rank 3 groups
- Subgraph counting identities and Ramsey numbers
- Some new Ramsey colorings
- House of Graphs: a database of interesting graphs
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- On some small classical Ramsey numbers
- A census of small transitive groups and vertex-transitive graphs
- Practical graph isomorphism. II.
- The strongly regular (45,\,12,\,3,\,3) graphs
- New lower bounds for 28 classical Ramsey numbers
- Graph Theory
- On Sets of Acquaintances and Strangers at any Party
- The ramsey number of k5 - e
- ARTICLES
- R(4, 5) = 25
- Combinatorial Relations and Chromatic Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)