The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
From MaRDI portal
Publication:396940
zbMath1295.05150arXiv1309.0038MaRDI QIDQ396940
Jan Goedgebeur, Stanislaw P. Radziszowski
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0038
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55)
Related Items
A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) ⋮ New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) ⋮ On Some Open Questions for Ramsey and Folkman Numbers
Uses Software
Cites Work
- On the Ramsey numbers R(3,8) and R(3,9)
- House of Graphs: a database of interesting graphs
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- On some small classical Ramsey numbers
- Ramsey Numbers Involving Cycles
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Generation of Cubic Graphs and Snarks with Large Girth
- Some graph theoretic results associated with Ramsey's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
