3 problems

Let $\mathcal{H}$ be a minor-closed graph class. For a graph $G$, let $\mathsf{id}_{\mathcal{H}}(G)$ denote the minimum number of edge identifications needed to transform $G$ into…

Let $G$ be a graph and let $e$ be an edge of $G$. Wigderson's conjecture. There is an absolute constant $C$ such that deleting one edge changes the Ramsey number by at most a const…

Cao et al.'s conjecture. All of these $H$-free edge modification problems admit polynomial kernels.