Results 141 to 150 of about 4,343 (225)

Active Orders for Matroid Bases

open access: yes, 2001
We introduce three orderings of the basis set of an ordered matroid, defined in terms of basis activities. We show that the active orders have lattice structures. This property contains both the neighboring property of the lexicographic ordering of bases,
Las Vergnas, Michel
core   +1 more source

Matroid bases with cardinality constraints on the intersection. [PDF]

open access: yesMath Program, 2022
Lendl S, Peis B, Timmermans V.
europepmc   +1 more source

Extremal Problems in Matroid Connectivity

open access: yes, 2014
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say that a matroid is 2-connected if and only if for each pair of elements, there is a circuit containing both elements.
John Tyler Moss, Moss, John Tyler
core   +1 more source

Non-Preemptive Tree Packing. [PDF]

open access: yesAlgorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Matroid Covering

open access: yes, 1994
Matroid ...
Young, N.
core  

On matroid connectivity

open access: yesJournal of Combinatorial Theory, Series B, 1981
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize corresponding notions of graph connectivity. A theorem of Tutte on cyclically 3-connected graphs, is generalized to matroids.
openaire   +1 more source

Online Matroid Embeddings

open access: yes
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid.
Dütting, Paul   +3 more
core  

Idealness of k-wise intersecting families. [PDF]

open access: yesMath Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source

Home - About - Disclaimer - Privacy