2 problems
Matching
Clique-root conjecture. If is -free, then has only clique roots.
Balanced-graph conjecture. Any flat graph is a balanced graph.
Clique-root conjecture. If is -free, then has only clique roots.
Balanced-graph conjecture. Any flat graph is a balanced graph.