heterochromatic number

¿Are critical k-forests tight? ★★

Author(s): Strausz

Conjecture

Let $H$ be a $k$ -uniform hypergraph. If $H$ is a critical $k$ -forest, then it is a $k$ -tree.

Posted by Dino
updated May 5th, 2014