Three color Ramsey number of K_ 4-e
From MaRDI portal
By \((K_ 4-e)\) we mean the graph obtained by deleting one edge from the complete graph on four vertices. The Ramsey number \(r(K_ 4-e;3)\) is the smallest positive integer n so that, if the edges of \(K_ n\) (the complete graph on n vertices) are colored with three colors, then at least one of the graphs induced by the edge of a single color contains a copy of \((K_ 4-e)\). This paper is devoted to a proof that \(28\leq r(K_ 4-e;3)\leq 32\).
Recommendations
Cites work
- A survey of bounds for classical Ramsey numbers
- Combinatorial Relations and Chromatic Graphs
- Generalised Ramsey numbers for small graphs
- scientific article; zbMATH DE number 3882465 (Why is no real title available?)
- scientific article; zbMATH DE number 4043886 (Why is no real title available?)
- scientific article; zbMATH DE number 3011797 (Why is no real title available?)
- Lower bounds for Ramsey numbers and association schemes
- On a combinatorial generalization of 27 lines associated with a cubic surface
- Parallel concepts in graph theory
- Strongly regular graphs
Cited in
(10)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- Three-color Ramsey numbers of \(K _{n }\) dropping an edge
- Three color Ramsey numbers for graphs with at most 4 vertices
- scientific article; zbMATH DE number 1161386 (Why is no real title available?)
- On Some Multicolor Ramsey Numbers Involving K₃+e and K₄-e
- Semidefinite programming and Ramsey numbers
- scientific article; zbMATH DE number 2192153 (Why is no real title available?)
- On some open questions for Ramsey and Folkman numbers
- Ramsey and Gallai-Ramsey numbers of cycles and books
- Bounds on small Ramsey numbers by semidefinite programming
This page was built for publication: Three color Ramsey number of \(K_ 4-e\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804597)
