2 problems
- 0 votes0 replies0 views
The comparison conjecture for -eigenvalue bounds
Let be a simple graph, with maximum degree , minimum degree , and let . Comparison conjecture. One has … The inequality asserts that the lower b…
- 0 votes0 replies0 views
The simple-graph degree-f arboricity conjecture
Simple-graph degree- arboricity conjecture. Truszczyński's degree- arboricity conjecture should hold for simple graphs: for every such and ,