Results 21 to 30 of about 511 (171)
Characterizing matroids whose bases form graphic delta-matroids [PDF]
European Journal of Combinatorics, 2022 We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular matroids. We give a structural characterization of the class of delta-graphic matroids.
Duksang Lee, Sang-il Oum
openaire +2 more sources
On Some Properties of Base-matroids
Electronic Notes in Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MAFFIOLI, FRANCESCO, ZAGAGLIA, NORMA
openaire +4 more sources
Detection of Emergent Situations in Complex Systems by Structural Invariant (MB, M)
Mendel, 2017 The paper introduces complete description of the detection method that uses structural invariant Matroid and its Bases (MB, M). There are recapitulated essential concepts from the used knowledge field as “complex system, emergent situations (A, B, C ...
Jiri Bila, Martin Novak
doaj +1 more source
The Base-Matroid and Inverse Combinatorial Optimization [PDF]
, 2003 A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of its bases, hence we call it Base-Matroid. Besides some properties of the base-matroid, a non trivial algorithm for the solution of the related matroid ...
DELL'AMICO, Mauro +5 more
core +1 more source
, 2022 This chapter introduces matroids, gives several basic examples of them, describes the fundamental constructions for matroids. and defines the Tutte polynomial for matroids. • The matroid theory conventions throughout the handbook. • Circuits, independent
Oxley, James
core +1 more source
Modeling of Complex Systems by Means of Partial Algebras
Mendel, 2019 Complex systems are very hard to describe by some unified language and calculus. In cases when their nature is very heterogeneous is possible to use with advantage state description.
Jiri Bila +2 more
doaj +1 more source
Counting Bases of Representable Matroids [PDF]
The Electronic Journal of Combinatorics, 2012 We show that it is #P-complete to count the number of bases of matroids representable over a fixed infinite field or fields of fixed characteristic.
openaire +2 more sources
Matroids on the Bases of Simple Matroids
European Journal of Combinatorics, 1981 Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M, F) and H(M, F), which depend on a field F. S(M, F) is the simplicial matroid with coefficients in F on the bases of M considered as simplices. H(M, F) has been studied by Björner in [1].
openaire +1 more source
On the k-volume rigidity of a simplicial complex in ℝ d
Forum of Mathematics, SigmaWe define a generic rigidity matroid for k-volumes of a simplicial complex in $\mathbb {R}^d$ and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic d-rigidity matroid on the same vertex set (namely, the case
Alan Lew +3 more
doaj +1 more source
Some inequalities for the Tutte polynomial
, 2011 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2011 ElsevierWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portion of the line x+y=p ...
Noble, Steven D. +15 more
core +1 more source