Lower bounds for Ramsey numbers and association schemes
From MaRDI portal
Publication:1084415
DOI10.1016/0095-8956(87)90067-0zbMath0606.05047OpenAlexW2084021260MaRDI QIDQ1084415
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90067-0
Related Items (12)
Covers of complete graphs and related association schemes ⋮ Three-color Ramsey numbers of \(K _{n }\) dropping an edge ⋮ Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization ⋮ Ramsey numbers of large books ⋮ THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS ⋮ A generalised linear Ramsey graph construction ⋮ Lower bounds for Ramsey numbers of \(K_n\) with a small subgraph removed ⋮ Tatra Schemes and Their Mergings ⋮ Bounds for Ramsey numbers of complete graphs dropping an edge ⋮ CLIQUE NUMBERS OF PALEY GRAPHS ⋮ Some further results in Ramsey graph construction ⋮ Three color Ramsey number of \(K_ 4-e\)
Cites Work
- Unnamed Item
- Schur numbers and the Ramsey numbers N(3,3,\dots ,3;2)
- Sum-free sets and Ramsey numbers
- Some lower bounds of the Ramsey number \(n(k,k)\).
- On the Ramsey numbers N(3,3,\dots ,3;2)
- A class of self-complementary graphs and lower bounds of some ramsey numbers
- On a class of edge-regular graphs
- Regular 2-Graphs
- Distance-Regular Graphs with Diameter Three
- New lower bounds of some diagonal Ramsey numbers
- On the maximal triangle-free edge-chromatic graphs in three colors
This page was built for publication: Lower bounds for Ramsey numbers and association schemes
