Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...
The Monthly publishes articles, as well as notes and other features, about mathematics and the profession. Its readers span a broad spectrum of mathematical interests, and include professional ...
It is shown that for arbitrary positive integers $m, n$ there exists a $\phi(m, n)$ such that if $\chi(G) \geqslant \phi(m, n)$, then $G$ contains either a complete ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback