3 problems

Fractional packing conjectures. There exists a constant $C>0$ such that, for every graph $G$,

Let $G$ be a graph of maximum degree $\Delta$ such that the neighbourhood of every vertex spans at most $\Delta^2/f$ edges. List-colouring conjecture. For every $\varepsilon>0$, th…

Clique-local fractional Reed conjecture. Every graph $G$ satisfies