Citation
Ricardo Strausz. Maximum k-Forests Are Tight. // Annals of Combinatorics. – 2026. – DOI: 10.1007/s00026-026-00834-w. – URL: https://doi.org/10.1007/s00026-026-00834-w
Ricardo Strausz (2026). Maximum k-Forests Are Tight. Annals of Combinatorics. https://doi.org/10.1007/s00026-026-00834-w
Ricardo Strausz. “Maximum k-Forests Are Tight.” Annals of Combinatorics, 2026. doi:10.1007/s00026-026-00834-w.
@article{Strausz2026,
title = {Maximum k-Forests Are Tight},
author = {Strausz, Ricardo},
journal = {Annals of Combinatorics},
year = {2026},
doi = {10.1007/s00026-026-00834-w},
url = {https://doi.org/10.1007/s00026-026-00834-w}
}