Three color Ramsey number of \(K_ 4-e\) (Q804597)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Three color Ramsey number of K_ 4-e |
scientific article; zbMATH DE number 4202302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three color Ramsey number of \(K_ 4-e\) |
scientific article; zbMATH DE number 4202302 |
Statements
Three color Ramsey number of \(K_ 4-e\) (English)
0 references
1991
0 references
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\).
0 references
Ramsey number
0 references
0.8812903165817261
0 references
0.8541007041931152
0 references
0.848660409450531
0 references
