Answers are grounded in this paper and cite their sources.
Theoretical analysis demonstrates that maximum k-forests are tight in hypergraph spaces, resolving a longstanding conjecture by Victor Neumann-Lara.
The aim of this note is to prove that maximum k -forest, in the sense of Lovász, are tight, in the sense of Arocha, Bracho and Neumann-Lara. This solves a conjecture of Victor Neumann-Lara.
No takes yet. Share an insight, caveat, or question.
Ricardo Strausz (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: