Strausz, Ricardo
¿Are critical k-forests tight? ★★
Author(s): Strausz
Conjecture
Let be a -uniform hypergraph. If is a critical -forest, then it is a -tree.
Keywords: heterochromatic number
Author(s): Strausz
Let be a -uniform hypergraph. If is a critical -forest, then it is a -tree.
Keywords: heterochromatic number