Results 171 to 180 of about 96,090 (258)

How to see the forest despite the trees

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley   +1 more source

Lower bounds for cube‐ideal set‐systems

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi   +3 more
wiley   +1 more source

Builder-Blocker Mutual-Visibility Game. [PDF]

open access: yesBull Malays Math Sci Soc
Chenoweth VI   +4 more
europepmc   +1 more source

Decomposition of complete bipartite graphs into paths and cycles

open access: yesDiscrete Mathematics, 2014
S. Jeevadoss, A. Muthusamy
semanticscholar   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

open access: yesJ Chem Theory Comput
Golnik R   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy