Clique minors in graphs with a forbidden subgraph

25 Feb 2020 Bucić M. Fox J. Sudakov B.

The classical Hadwiger conjecture dating back to 1940's states that any graph of chromatic number at least $r$ has the clique of order $r$ as a minor. Hadwiger's conjecture is an example of a well studied class of problems asking how large a clique minor one can guarantee in a graph with certain restrictions... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS