2 problems
For positive integers and with , let denote the complete bipartite graph with parts of sizes and , and let denote its correspondence pa…
Let be a graph and let . Vertex-deletion conjecture. Then … Equivalently, adding a new vertex adjacent to all existing vertices increases the correspondence packing…