Year: 2026
Type: article
Abstract: 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.
Source: Annals of Combinatorics
Author: Ricardo Strausz
Institution: Universidad Nacional Autónoma de México
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,990
OpenAlex ID: W7204947664