Results 131 to 140 of about 4,266 (227)
Discrete Mathematics, 1977 AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D so that A is adjacent to B but not to C, and D is adjacent to C but not to B. A graph is called matroidal if the binary relation “equals to or forms a couple with” among its edges is an equivalence relation. The structure of matroidal graphs is determined.
openaire +2 more sources
, 2009 Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as ...
FESTA, PAOLA
core +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, SigmaWe provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve $\mathcal {E}$ with complex multiplication.
Luca Moci +3 more
doaj +1 more source
, 1992 Matroids with an arbitrary domain of coefficients have been introduced in [A. W. M. Dress, Adv. Math.59 (1986), 97–123] and, since, studied in [A. W. M. Dress and W. Wenzel, Adv. Math.77 (1989), 1–36; Adv. Math.86 (1991), 68–110; Bayreuth. Math. Schr.26 (
Wenzel, Walter +2 more
core +1 more source
, 2011 It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals.In this paper
Bruhn, Henning +3 more
core +1 more source
Idealness of k-wise intersecting families. [PDF]
Math Program, 2022 Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc +1 more source
Discrete Mathematics, 1997 ``Good'' colorings of a matroid partition the ground set \(E=E_1\cup E_2\cup\cdots\cup E_c\) such that every transversal (\(T\subseteq E\) with \(|T\cap E_i|\leq 1\)) is independent, and such that for every line \(\ell\subseteq E\) some \(\ell\cap E_i\) is a singleton. This notion is due to Falk and Jambu [unpublished preprint, 1989]. Here it is proved
openaire +1 more source
, 2017 A coloring of the ground set of a matroid is proper if elements of the same color form an independent set. For a loopless matroid M, its chromatic number χ(M) is the minimum number of colors in a proper coloring.
Lason, Michael
core +1 more source
, 2015 Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, quasi-graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids,
Geelen, Jim +5 more
core