English
Related papers

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

200 papers

We study arrangements of slightly skewed tropical hyperplanes, called blades by A. Ocneanu, on the vertices of a hypersimplex $\Delta_{k,n}$, and we investigate the resulting induced polytopal subdivisions. We show that placing a blade on a…

Combinatorics · Mathematics 2022-06-03 Nick Early

We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Combinatorics · Mathematics 2018-05-21 Adam Brown , Peter Nelson

It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…

Combinatorics · Mathematics 2023-02-20 Eleftherios Kastis , Stephen Power

The {\em breadth} of a tangle $\mathcal{T}$ in a matroid is the size of the largest spanning uniform submatroid of the tangle matroid of $\mathcal{T}$. A matroid $M$ is {\em weakly $4$-connected} if it is 3-connected and whenever $(X,Y)$ is…

Combinatorics · Mathematics 2025-04-17 Nick Brettell , Susan Jowett , James Oxley , Charles Semple , Geoff Whittle

Tutte showed that $4$-connected planar graphs are Hamiltonian, but it is well known that $3$-connected planar graphs need not be Hamiltonian. We show that $K_{2,5}$-minor-free $3$-connected planar graphs are Hamiltonian. This does not…

Combinatorics · Mathematics 2016-10-21 M. N. Ellingham , Emily A. Marshall , Kenta Ozeki , Shoichi Tsuchiya

Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…

Combinatorics · Mathematics 2017-06-27 James Oxley , Charles Semple , Geoff Whittle

We consider compact 3-manifolds M having a submersion h to R in which each generic point inverse is a planar surface. The standard height function on a submanifold of the 3-sphere is a motivating example. To (M, h) we associate a…

Geometric Topology · Mathematics 2007-05-23 Martin Scharlemann , Jennifer Schultens

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

Combinatorics · Mathematics 2026-04-10 Veronika Körber , Tobias Schnieders , Jan Stricker , Jasmin Walizadeh

We construct a $\wedge$-homogeneous universal simple matroid of rank $3$, i.e. a countable simple rank~$3$ matroid $M_*$ which $\wedge$-embeds every finite simple rank $3$ matroid, and such that every isomorphism between finite…

Logic · Mathematics 2018-10-04 Gianluca Paolini

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Combinatorics · Mathematics 2013-11-28 Vanessa Chatelain , Jorge Ramirez Alfonsin

We prove that for each prime power $q$ there is an integer $n$ such that if $M$ is a $3$-connected, representable matroid with a PG$(n-1,q)$-minor and no $U_{2,q^2+1}$-minor, then $M$ is representable over GF$(q)$. We also show that for…

Combinatorics · Mathematics 2015-03-31 Jim Geelen , Rohan Kapadia

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

Combinatorics · Mathematics 2021-10-12 Luyining Gan , Jie Han , Lin Sun , Guanghui Wang

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…

Combinatorics · Mathematics 2025-02-25 Kevin Grace

A graph $G$ is $\{F_{1}, F_{2},\dots,F_{k}\}$-free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1\leq i \leq k)$. A connected graph $G$ is a split graph if its vertex set can be partitioned into a clique and an…

Combinatorics · Mathematics 2026-03-16 Tao Tian , Fengming Dong

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

We prove that if $H$ is a subgraph of a complete multipartite graph $G$, then $H$ contains a connected component $H'$ satisfying $|E(H')||E(G)|\geq |E(H)|^2$. We use this to prove that every three-coloring of the edges of a complete graph…

Combinatorics · Mathematics 2022-08-30 Sammy Luo

Let \A be a complex hyperplane arrangement, and let $X$ be a modular element of arbitrary rank in the intersection lattice of \A. We show that projection along $X$ restricts to a fiber bundle projection of the complement of \A to the…

Combinatorics · Mathematics 2007-05-23 Michael J. Falk , Nicholas J. Proudfoot

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Computational Geometry · Computer Science 2015-03-17 Jean Cardinal , Matias Korman

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

In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…

Combinatorics · Mathematics 2017-11-17 Hariharan Narayanan , H. Narayanan