Showing 2025Show all
2 papers · 1 filter
cs.DM2025
How to see the forest despite the trees
Erika Bérczi-Kovács, András Frank
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of disjoint spanning trees of a graph, along with its count…
math.CO2025
Prefix-bounded matrices
Nóra A. Borsik, András Frank, Péter Madarasi +1
By unifying various earlier extensions of alternating sign matrices (ASMs), we introduce the notion of prefix-bounded matrices (PBMs). It is shown that the convex hull of these mat…