2 problems
Let be a simple graph, with maximum degree , minimum degree , and let . Comparison conjecture. One has … The inequality asserts that the lower b…
Linear Arboricity Conjecture. For every simple graph ,
Let be a simple graph, with maximum degree , minimum degree , and let . Comparison conjecture. One has … The inequality asserts that the lower b…
Linear Arboricity Conjecture. For every simple graph ,