Results 31 to 40 of about 759 (82)
Excluding Kuratowski graphs and their duals from binary matroids
, 2017 We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of {M(K3,3),M*(K3,3),M(K5),M*(K5)} that ...
Mayhew, Dillon +2 more
core +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
Foundations for a theory of complex matroids
, 2012 We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids.
Anderson, Laura, Delucchi, Emanuele
core +1 more source
The structure of 2-separations of infinite matroids [PDF]
, 2015 Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits, and the edges
Aigner-Horev, Elad +2 more
core
Infinite Matroids and Determinacy of Games [PDF]
, 2013 Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that the class of ...
Bowler, Nathan, Carmesin, Johannes
core
, 2012 We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank.
Bruhn, Henning +4 more
core +3 more sources
Matroids with a cyclic arrangement of circuits and cocircuits [PDF]
European Journal of Combinatorics, 2019 20 ...
Nick Brettell +3 more
openaire +3 more sources
Optimal cocircuits in regular matroids and applications
Journal of Computational and Applied Mathematics, 1982 AbstractLet M = (E, C) be a regular matroid with circuit set H and cocircuit set H and let (H, +, ⪕) be an ordered group. To given partitions D = D+ ∈ D− for all D ϵ H and weighting functions ℓ,k: E → H optimale ê-cocircuits are defined by having a minimal value K(D+) − ol(D−ø ∗^e∗.It is shown that P as well as NP problems can be formulated by means of
University of Florida, Department of Industrial and Systems Engineering Weil Hall, Gainesville, FL 32611, USA ( host institution ) +1 more
openaire +3 more sources
Generalized spikes with circuits and cocircuits of different cardinalities
Advances in Applied Mathematics, 2023 We consider matroids with the property that every subset of the ground set of size $s$ is contained in a $2s$-element circuit and every subset of size $t$ is contained in a $2t$-element cocircuit. We say that such a matroid has the \emph{$(s,2s,t,2t)$-property}.
Nick Brettell, Kevin Grace
openaire +3 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