Learn More
Let G be a graph with n vertices and independence number α. Hadwiger’s conjecture implies that G contains a clique minor of order at least n/α. In 1982, Duchet and Meyniel proved that this bound(More)