English
Related papers

Related papers: What is a 4-connected matroid?

200 papers

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

We prove that 3-connected triangulations with at most one separating triangle are hamiltonian-connected. In order to show bounds on the strongest form of this theorem, we proved that for any $s\geq4$ there are 3-connected triangulation with…

Combinatorics · Mathematics 2016-05-05 Nico Van Cleemput

A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way. A lattice is a Tr-lattice if all matroids whose lattices of cyclic flats…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We provide new branched covering representations for bounded and/or non-compact 4-manifolds, which extend the known ones for closed 4-manifolds. Assuming $M$ to be a connected oriented PL 4-manifold, our main results are the following: (1)…

Geometric Topology · Mathematics 2020-08-05 Riccardo Piergallini , Daniele Zuddas

We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…

Combinatorics · Mathematics 2014-02-10 Robert F. Bailey , Mike Newman , Brett Stevens

The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…

Combinatorics · Mathematics 2016-02-10 Daniel S. Silver , Susan G. Williams

This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…

Discrete Mathematics · Computer Science 2016-02-16 Martin Grohe

We introduce and study a natural variant of matroid amalgams. For matroids M(A) and N(B) such that M/(A-B)=N(B-A), we define a splice of M and N to be a matroid L on the union of A and B with L(B-A)=M and L/(A-B)=N. We show that splices…

Combinatorics · Mathematics 2009-02-03 Joseph E. Bonin , William R. Schmitt

We construct four new elements $3.11>m_1>m_2>m_3>m_4$ of $M\backslash L$ lying in distinct connected components of $\mathbb{R}\setminus L$, where $M$ is the Markov spectrum and $L$ is the Lagrange spectrum. These elements are part of a…

Number Theory · Mathematics 2019-04-02 Davi Lima , Carlos Matheus , Carlos Gustavo Moreira , Sandoel Vieira

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…

Combinatorics · Mathematics 2011-01-28 Matthias Kriesell

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…

Combinatorics · Mathematics 2018-06-14 Xiaofeng Gu

Given a graph $G$ and two spanning trees $T$ and $T'$ in $G$, Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from $T$ to $T'$ such that all intermediates are also spanning trees of $G$, by exchanging an…

Combinatorics · Mathematics 2024-09-13 Tesshu Hanaka , Yuni Iwamasa , Yasuaki Kobayashi , Yuto Okada , Rin Saito

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…

Combinatorics · Mathematics 2022-10-03 Jose De Jesus , Alexander Kelmans

We investigate the strong Rayleigh property of matroids for which the basis enumerating polynomial is invariant under a Young subgroup of the symmetric group on the ground set. In general, the Grace-Walsh-Szeg\H{o} theorem can be used to…

Combinatorics · Mathematics 2014-12-01 Wenbo Gao , David G. Wagner

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

Combinatorics · Mathematics 2017-12-13 João Paulo Costalonga

Contraction$^*$-depth is a matroid depth parameter analogous to tree-depth of graphs. We establish the matroid analogue of the classical graph theory result asserting that the tree-depth of a graph $G$ is the minimum height of a rooted…

Combinatorics · Mathematics 2025-07-14 Marcin Brianski , Daniel Kral , Ander Lamaison

Branch points of a real 2-surface S in a 4-manifold M generalize the branch points of complex curves in complex surfaces: for example, they can occur as singularities of minimal surfaces. We investigate such a branch point p when S is…

Differential Geometry · Mathematics 2007-05-23 Marina Ville

A hypercomplex manifold is a manifold equipped with three complex structures I, J, K satisfying the quaternionic relations. Let M be a 4-dimensional compact smooth manifold equipped with a hypercomplex structure, and E be a vector bundle on…

Differential Geometry · Mathematics 2010-08-03 Ruxandra Moraru , Misha Verbitsky

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…

Geometric Topology · Mathematics 2026-05-01 Teruo Nagase , Akiko Shima