Results 121 to 130 of about 4,266 (227)

Matroid psi classes. [PDF]

Sel Math New Ser, 2022
Dastidar J, Ross D.
europepmc   +1 more source

Counting Rank-2 Matroids [PDF]

, 2000
We enumerate the number of rank-2 matroids, non-isomorphic rank-2 matroids, connected rank-2 matroids and non-isomorphic connected rank-2 matroids on a ground set of size n.
Dukes, W.M.B.
core  

Tropical ideals do not realise all Bergman fans. [PDF]

Res Math Sci, 2021
Draisma J, Rincón F.
europepmc   +1 more source

Fair Max-Min Diversity Maximization in Streaming and Sliding-Window Models. [PDF]

Entropy (Basel), 2023
Wang Y, Fabbri F, Mathioudakis M, Li J.
europepmc   +1 more source

On a matroid identity

Discrete Mathematics, 1983
AbstractThe purpose of this note is to prove an identity for generalized Tutte-Grothendieck invariants, at least two special cases of which have already proved to be of considerable use. In addition, one of these special cases is used to strengthen results of Lindström on the critical exponent of a representable matroid and the chromatic number of a ...
openaire   +2 more sources

On -connected splitting matroids

AKCE International Journal of Graphs and Combinatorics, 2019
In general, the splitting operation on a binary matroid does not preserve the connectivity of In this paper, we provide sufficient conditions to preserve -connectedness of a binary matroid under splitting operation.
Y.M. Borse, Ganesh Mundhe
doaj   +1 more source

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

Math Program, 2022
Lendl S, Peis B, Timmermans V.
europepmc   +1 more source

The matroid of a graphing

Journal of Combinatorial Theory, Series B
Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We prove that for a Benjamini--Schramm convergent sequence of graphs, the total rank, normalized by the number of nodes ...
openaire   +2 more sources

Menger's theorem for matroids

, 1965
Menger's Theorem asserts that if x and y are vertices of a graph which are not joined by an edge and if it takes at least k other vertices to separate x and y, then x and y can be joined by k distinct arcs in the graph whic h have only their end-vertices
Tutte, W. T.
core   +1 more source

Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding. [PDF]

Entropy (Basel), 2021
Chen Q, Cheng M, Bai B.
europepmc   +1 more source