Results 101 to 110 of about 275 (182)

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

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

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

Matroid connectivity and singularities of configuration hypersurfaces. [PDF]

Lett Math Phys, 2021
Denham G, Schulze M, Walther U.
europepmc   +1 more source

Elliptic arrangements of complex multiplication type

Forum of Mathematics, Sigma
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve $\mathcal {E}$ with complex multiplication.
Luca Moci, Roberto Pagaria, Maddalena Pismataro, Alejandro Vargas   +3 more
doaj   +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

Idealness of k-wise intersecting families. [PDF]

Math Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source

On algebraic matroids

Discrete Mathematics, 1993
The paper surveys recent results on algebraic matroids with the concentration on algebraic dependence over fields.
openaire   +2 more sources

Codes, matroids and derived matroids

, 2023
This thesis first introduces some theory on coding theory and matroids, and properties that are shared between these, and then we will investigate derived matroids. In 1979 Longyear made a construction of derived matroids for binary matroids, which illuminates "dependencies among dependencies".
openaire   +1 more source