English
Related papers

Related papers: On contracting hyperplane elements from a 3-connec…

200 papers

An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…

Combinatorics · Mathematics 2019-03-29 Tilman Moeller

It is well-known as an existence result that every 3-connected graph G=(V,E) on more than 4 vertices admits a sequence of contractions and a sequence of removal operations to K_4 such that every intermediate graph is 3-connected. We show…

Data Structures and Algorithms · Computer Science 2010-11-30 Jens M. Schmidt

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 introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…

Combinatorics · Mathematics 2017-09-15 Johannes Carmesin

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

Combinatorics · Mathematics 2013-11-14 Guangjun Xu , Sanming Zhou

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

Metric Geometry · Mathematics 2026-02-03 Efren Morales-Amaya

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of…

Combinatorics · Mathematics 2017-03-03 Dillon Mayhew , Gordon Royle , Geoff Whittle

Given a representation of a link group, we introduce a trilinear form, as a topological invariant. We show that, if the link is either hyperbolic or a knot with malnormality, then the trilinear form equals the pairing of the (twisted)…

Geometric Topology · Mathematics 2018-08-28 Takefumi Nosaka

Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…

Computational Geometry · Computer Science 2024-07-02 Valentino Boucard , Guilherme D. da Fonseca , Bastien Rivier

The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…

Combinatorics · Mathematics 2007-05-23 Carrie Eschenbrenner , Michael Falk

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Combinatorics · Mathematics 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

Brylawski and Seymour independently proved that if $M$ is a connected matroid with a connected minor $N$, and $e \in E(M) - E(N)$, then $M \backslash e$ or $M / e$ is connected having $N$ as a minor. This paper proves an analogous but…

Combinatorics · Mathematics 2019-08-28 Zachary Gershkoff , James Oxley

A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…

Combinatorics · Mathematics 2021-09-06 Jacob David , Pierce Lai , SuHo Oh , Christopher Wu

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

Combinatorics · Mathematics 2010-12-23 Andrei Gagarin , Gilbert Labelle , Pierre Leroux

Recently, Cuntz and K\"uhne introduced a particular class of hyperplane arrangements stemming from a given graph $G$, so called connected subgraph arrangements $A_G$. In this note we strengthen some of the result from their work and prove…

Combinatorics · Mathematics 2026-05-19 Lorenzo Giordani , Tilman Möller , Paul Mücksch , Gerhard Roehrle

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

Combinatorics · Mathematics 2007-05-23 John C. Owen , Stephen C. Power

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

Combinatorics · Mathematics 2015-12-18 Jonathan McLaughlin

Suppose that the 3-manifold M is given by integral surgery along a link L in S^3. In the following we construct a stable map from M to the plane, whose singular set is canonically oriented. We obtain upper bounds for the minimal numbers of…

Geometric Topology · Mathematics 2015-03-20 Boldizsar Kalmar , Andras I. Stipsicz

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

Combinatorics · Mathematics 2010-10-19 Andrey O. Matveev

It is shown that the edge ring of a finite connected simple graph with a $3$-linear resolution is a hypersurface.

Commutative Algebra · Mathematics 2020-09-08 Takayuki Hibi , Kazunori Matsuda , Akiyoshi Tsuchiya