Results 71 to 80 of about 4,003 (147)
On Binary Identically Self-dual Matroids
European Journal of Combinatorics, 1984 A matroid is identically self-dual when its set of bases is identical with its set of co-bases. The author proves that the only connected regular identically self-dual matroid is the uniform matroid of rank 1 on two points. He improves the known lower bound for the number of bases in an identically self-dual matroid.
openaire +2 more sources
On the existence of asymptotically good linear codes in minor-closed classes [PDF]
, 2014 Let $\mathcal{C} = (C_1, C_2, \ldots)$ be a sequence of codes such that each $C_i$ is a linear $[n_i,k_i,d_i]$-code over some fixed finite field $\mathbb{F}$, where $n_i$ is the length of the codewords, $k_i$ is the dimension, and $d_i$ is the minimum ...
Peter Nelson, Stefan H. M, Van Zwam
core
Γ-Extension of Binary Matroids [PDF]
ISRN Discrete Mathematics, 2011 We extend the notion of a point-addition operation from graphs to binary matroids. This operation can be expressed in terms of element-addition operation and splitting operation. We consider a special case of this construction and study its properties. We call the resulting matroid of this special case a Γ-extension of the given matroid.
openaire +1 more source
Binary Matroids with Graphic Cocircuits
, 2012 An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.
Papalamprou, Konstantinos +1 more
openaire +2 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raghunathan, T.T. +2 more
openaire +1 more source
Approximation operators via TD-matroids on two sets. [PDF]
Soft comput, 2022 Wang G, Mao H.
europepmc +1 more source
Rough set approximations based on a matroidal structure over three sets. [PDF]
Appl Intell (Dordr), 2023 Wang G, Mao H, Liu C, Zhang Z, Yang L.
europepmc +1 more source
On k-Connected Γ-Extensions of Binary Matroids
Lobachevskii Journal of Mathematics, 2018 Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $ $-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and sufficient conditions to preserve $k$-connectedness of a binary matroid under the $ $-extension operation.
Borse, Y. M., Mundhe, Ganesh
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
The Smallest Rounded Sets of Binary Matroids
European Journal of Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oxley, James G., Reid, Talmage James
openaire +2 more sources