How to see the forest for the trees

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bérczi-Kovács, Erika, Frank, András
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908615090110464
author Bérczi-Kovács, Erika
Frank, András
author_facet Bérczi-Kovács, Erika
Frank, András
contents One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of $k$ disjoint spanning trees of a graph along with its counterpart on the existence of $k$ forests covering all edges of the graph. These elegant results triggered a comprehensive research that gave rise to far-reaching generalizations and found applications at seemingly far-fetched areas. There are well over a thousand papers in the literature, including quite a few brand-new ones. Our first goal is to enlighten some aspects and links of these developments with the hope that the melody finds its way to non-experts. But we hope that experts will also find some novelties in our orchestration.
format Preprint
id arxiv_https___arxiv_org_abs_2510_23614
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle How to see the forest for the trees
Bérczi-Kovács, Erika
Frank, András
Discrete Mathematics
Combinatorics
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of $k$ disjoint spanning trees of a graph along with its counterpart on the existence of $k$ forests covering all edges of the graph. These elegant results triggered a comprehensive research that gave rise to far-reaching generalizations and found applications at seemingly far-fetched areas. There are well over a thousand papers in the literature, including quite a few brand-new ones. Our first goal is to enlighten some aspects and links of these developments with the hope that the melody finds its way to non-experts. But we hope that experts will also find some novelties in our orchestration.
title How to see the forest for the trees
topic Discrete Mathematics
Combinatorics
url https://arxiv.org/abs/2510.23614