1 problem

Connected transversal conjecture. The lower bound in Theorem is tight. In particular, for any $r\geq 4$, every $r$-partite graph with $r$-partite density at least…