6 problems
Correspondence coloring conjecture. The graph has disjoint -colorings. Equivalently,
Chen–Zhang's conjecture.
Edge-coloring conjecture. Then is class .
Signless Laplacian extremal conjecture.
Let be any proper minor-closed family of graphs. The constant-congestion integrality-gap conjecture. The integrality gap of the flow LP for maximum edge-disjoint paths i…
Square-root query-complexity conjecture. For every , being -minor free can be tested with one-sided error using queries, where is the number of vert…