scientific article; zbMATH DE number 3889573
[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\).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222882)