2 problems
Matching
Blowup recolorability conjecture. Every blowup of is recolorable if and only if every induced subgraph of is recolorable.
Let be a graph with . The prime bound is the smallest integer such that admits a prime -extension; here denotes the stability number…