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, ...

Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science. A ...

He wanted to be a poet, then a science journalist. Only in his last year in college did Dr. Huh discover math as a calling. By Kenneth Chang Most top mathematicians discovered the subject when they ...