3 problems

List strengthening conjecture. For every integer $k\geq 2$, if a graph $G$ has minimum degree $\delta(G)\geq k^2$, then $G$ has a $1/k$-majority edge colouring from any lists of si…

List distinguishing index conjecture.

List-homomorphism product conjecture. Then