No label defined (Q3222882)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3889573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3889573 |
Statements
1984
0 references
Ramsey number
0 references
five-spoked wheel
0 references
0.9145323038101196
0 references
0.8092451095581055
0 references
0.8088873624801636
0 references
[For the entire collection see Zbl 0547.00011.] Given a graph G, r(G) is the smallest integer r so that, if one colors the edges of the complete graph on r vertices with two colors then there exists a subgraph isomorphic with G with all of the edges colored with the same color. Paul Erdős has conjectured that \(r(G)\geq r(K_ n)\) for any graph G with chromatic number n. This conjecture has been proved for \(n=3\) and the case \(n=4\) depends upon the value of \(r(W_ 6)\) and \(W_ 6\) is the ''five-spoked wheel''. The author improves the known bounds on this number by proving that \(r(W_ 6)\leq 19\).
0 references