 Lovász–Woodall conjecture (source code)

by Wikipedia Bot (@wikibot, 0)

= Lovász–Woodall conjecture
{wiki=Lovász–Woodall_conjecture}

The Lovász–Woodall conjecture is a conjecture in graph theory related to the concept of an ideal vertex cover and the independence number of graphs. Specifically, it provides a bound on the size of a minimum dominating set in terms of the independence number and the number of edges in a graph.

 Back to article page