English
Related papers

Related papers: Quasi-graphic matroids

200 papers

One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…

Combinatorics · Mathematics 2026-03-09 Changxin Ding , Donggyu Kim

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

The element splitting operation on a graphic matroid, in general may not yield a cographic matroid. In this paper, we give a necessary and sufficient condition for the graphic matroid to yield cographic matroid under the element splitting…

Combinatorics · Mathematics 2018-10-09 S. B. Dhotre , P. P. Malavadkar

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Combinatorics · Mathematics 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

An $n\times n$ real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI_{n}$ for some positive real number $q$. If $M$ is a principal sub-matrix of a quasi-orthogonal matrix $Q$, we say that $Q$ is a quasi-orthogonal extension of $M$. In a…

Combinatorics · Mathematics 2024-12-16 Abderrahim Boussaïri , Brahim Chergui , Zaineb Sarir , Mohamed Zouagui

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit…

Combinatorics · Mathematics 2020-05-19 Lucas J. Rusnak , Selena Li , Brian Xu , Eric Yan , Shirley Zhu

We introduce the notion of sum-matroids and show its association with sum-rank metric codes. As a consequence, some results for sum-rank metric codes by Mart\'inez-Pe\~nas are generalized for sum-matroids. The sum-matroids generalize the…

Combinatorics · Mathematics 2022-03-23 Avijit Panja , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…

Artificial Intelligence · Computer Science 2012-12-03 Yanfang Liu , William Zhu

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures,…

Combinatorics · Mathematics 2016-08-02 Dalibor Froncek , William J. Keith , Donald L. Kreher

In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…

Combinatorics · Mathematics 2019-06-13 Patrick Tam

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

A weighing matrix $W$ is quasi-balanced if $|W||W|^\top=|W|^\top|W|$ has at most two off-diagonal entries, where $|W|_{ij}=|W_{ij}|$. A quasi-balanced weighing matrix $W$ signs a strongly regular graph if $|W|$ coincides with its adjacency…

Combinatorics · Mathematics 2022-02-04 Hadi Kharaghani , Thomas Pender , Sho Suda

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

G-frames are generalized frames which include ordinary frames, bounded invertible linear operators, as well as many recent generalizations of frames, e.g., bounded quasi-projectors and frames of subspaces. G-frames are natural…

Functional Analysis · Mathematics 2007-05-23 Wenchang Sun

A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…

Combinatorics · Mathematics 2024-10-16 Kristóf Bérczi , Márton Borbényi , László Lovász , László Márton Tóth

The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.

Combinatorics · Mathematics 2021-11-30 Takayuki Hibi , Michał Lasoń , Kazunori Matsuda , Mateusz Michałek , Martin Vodička