Maximum k-Forests Are Tight
The aim of this note is to prove that maximum $${\textit{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.
Authors
- Ricardo Strausz (ORCID: https://orcid.org/0000-0001-6017-7789)
Publication Details
- Journal
- Annals of Combinatorics
- Published
- 2026-09-01
- DOI
- https://doi.org/10.1007/s00026-026-00834-w
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- article
- Field-Weighted Citation Impact
- 0.00