3 problems

Wood's conjecture. The number of $k$-cliques in a $K_t$-minor free graph on $n$ vertices is at most

Let $G$ be a finite graph. A Kempe coloring is a partition of $V(G)$ into anticliques such that the union of any two color classes induces a connected subgraph. A transversal $T$ o…

For a graph $G$, let $s(G)$ denote the largest $k$ such that $G$ has $k$ pairwise disjoint pairwise adjacent connected subgraphs of size $1$ or $2$. An antitriangle is a set of thr…