3 problems

For positive integers $a$ and $b$ with $a>b$, let $K_{a,b}$ denote the complete bipartite graph with parts of sizes $a$ and $b$, and let $\chi_c^\star$ denote its correspondence pa…

Let $G$ be a graph and let $v\in V(G)$. Vertex-deletion conjecture. Then … Equivalently, adding a new vertex adjacent to all existing vertices increases the correspondence packing…

Consider a group-partitioning problem with $n$ cohorts, each containing $k$ students, where for every student $S$ and every cohort $C$ not containing $S$ there is at most one stude…