English
Related papers

Related papers: Cyclic Orderings and Cyclic Arboricity of Matroids

200 papers

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

Combinatorics · Mathematics 2011-09-06 Naoki Katoh , Shin-ichi Tanigawa

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…

Group Theory · Mathematics 2016-01-20 Vincent Guirardel , Gilbert Levitt

We show that the basis graph of an even delta-matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges $e$ and $f$ sharing a common end, it has a Hamiltonian cycle using $e$ and avoiding…

Combinatorics · Mathematics 2025-08-15 Donggyu Kim , Sang-il Oum

The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…

Combinatorics · Mathematics 2015-09-15 S. R. Kingan , Manoel Lemos

For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…

Combinatorics · Mathematics 2021-06-17 Andrey O. Matveev

We study a particular graded ring structure on the set of all loopfree matroids on a fixed labeled ground set, which occurs naturally in tropical geometry. The product is given by matroid intersection and the additive structure is defined…

Combinatorics · Mathematics 2016-09-05 Simon Hampe

We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…

Logic · Mathematics 2019-02-14 Gérard Leloup

We study some properties of a serial (i.e. one-by-one) symmetric exchange of elements of two disjoint bases of a matroid. We show that any two elements of one base have a serial symmetric exchange with some two elements of the other base.…

Combinatorics · Mathematics 2013-04-19 Daniel Kotlar , Ran Ziv

The aim of this note is to show that the cycle decomposition of elements of the symmetric group admits a quite natural formulation in the framework of dual Coxeter theory, yielding a generalization of it to the family of so-called parabolic…

Group Theory · Mathematics 2016-11-11 Thomas Gobet

Our input is a directed, rooted graph $G = (V \cup \{r\},E)$ where each vertex in $V$ has a partial order preference over its incoming edges. The preferences of a vertex extend naturally to preferences over arborescences rooted at $r$. We…

Data Structures and Algorithms · Computer Science 2023-10-31 Telikepalli Kavitha , Kazuhisa Makino , Ildikó Schlotter , Yu Yokoi

We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…

Combinatorics · Mathematics 2018-11-20 Monique Laurent , Shin-ichi Tanigawa

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

Combinatorics · Mathematics 2014-05-27 Gary Gordon , Jennifer McNulty , Nancy Ann Neudauer

We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…

Logic in Computer Science · Computer Science 2025-07-01 Mohammad Abdulaziz , Thomas Ammer , Shriya Meenakshisundaram , Adem Rimpapa

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 e>1 be an integer. Among the finite 3-groups G with bicyclic commutator quotient G/G' ~ C(3^e) * C(3), having one non-elementary component with logarithmic exponent e, there exists a unique pair of coclass trees with distinguished rank…

Group Theory · Mathematics 2022-01-03 Daniel C. Mayer

We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…

Combinatorics · Mathematics 2025-10-27 David Bevan , Robert Brignall , Nik Ruškuc

We derive several existence results concerning cycle types and, more generally, the "mapping behavior" of complete mappings. Our focus is on so-called first-order cyclotomic mappings, which are functions on a finite field $\mathbb{F}_q$…

Number Theory · Mathematics 2021-05-04 Alexander Bors , Qiang Wang

We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the M\"obius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to…

Combinatorics · Mathematics 2022-10-25 Trygve Johnsen , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

An element $e$ of a $3$-connected matroid $M$ is elastic if ${\rm si}(M/e)$, the simplification of $M/e$, and ${\rm co}(M\backslash e)$, the cosimplification of $M\backslash e$, are both $3$-connected. It was recently shown that if…

Combinatorics · Mathematics 2022-07-20 George Drummond , Charles Semple
‹ Prev 1 3 4 5 6 7 10 Next ›