English
Related papers

Related papers: The internally 4-connected binary matroids with no…

200 papers

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

Combinatorics · Mathematics 2025-12-05 Emiliano Liwski , Fatemeh Mohammadi , Rémi Prébet

We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…

Combinatorics · Mathematics 2014-03-10 Jim Geelen , Peter Nelson

Let G(d,n) denote the Grassmannian of d-planes in C^n and let T be the torus (C^*)^n/diag(C^*) which acts on G(d,n). Let x be a point of G(d,n) and let \bar{Tx} be the closure of the T-orbit through x. Then the class of the structure sheaf…

Algebraic Geometry · Mathematics 2007-05-23 David E Speyer

We show that, if $q$ is a prime power at most 5, then every rank-$r$ matroid with no $U_{2,q+2}$-minor has no more lines than a rank-$r$ projective geometry over GF$(q)$. We also give examples showing that for every other prime power this…

Combinatorics · Mathematics 2013-06-12 Jim Geelen , Peter Nelson

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

Combinatorics · Mathematics 2025-12-18 Jonathan Boretsky , Zach Walsh

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…

Combinatorics · Mathematics 2023-01-06 Shital D. Solanki , Ganesh Mundhe , S. B. Dhotre

A theorem of Tutte states that every 4-connected non-hamiltonian graph contains $K_{3,3}$ as a minor. We strengthen this result by proving that such a graph must contain $K_{3,4}$ as a minor, thereby confirming a special case of a…

Combinatorics · Mathematics 2025-06-26 On-Hei Solomon Lo

Four $\ZZ_+$-bigraded complexes with the action of the exceptional infinite-dimensional Lie superalgebra E(3,6) are constructed. We show that all the images and cokernels and all but three kernels of the differentials are irreducible…

Mathematical Physics · Physics 2014-01-17 Victor G. Kac , Alexei Rudakov

An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.

Combinatorics · Mathematics 2012-05-07 Konstantinos Papalamprou , Leonidas Pitsoulis

In 2004, Ehrenfeucht, Harju, and Rozenberg showed that any graph on a vertex set $V$ can be obtained from a complete graph on $V$ via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local…

Combinatorics · Mathematics 2020-04-20 James Oxley , Jagdeep Singh

Tuza (A conjecture, in Proceedings of the Colloquia Mathematica Societatis Janos Bolyai, 1981) conjectured that $\tau(G) \le 2\nu(G)$ for all graphs $G$, where $\tau(G)$ is the minimum size of an edge set whose removal makes $G$…

Combinatorics · Mathematics 2022-05-24 Kazuhiro Nomoto , Jorn van der Pol

A symmetric matrix $M=(m_{ij}) \in \mathbb{R}^{n \times n}$ is said to be associated with an $n$-vertex graph $G=(V,E)$ with vertex set $\{v_1,\ldots,v_n\}$ if, for every $i \neq j$, we have $m_{ij} \neq 0$ if and only if $\{v_i,v_j\}\in…

Combinatorics · Mathematics 2026-02-10 Luiz Emilio Allem , Martin Fürer , Carlos Hoppen , Lucas Siviero Sibemberg , Vilmar Trevisan

We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_4}$ with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar…

Combinatorics · Mathematics 2010-12-30 Elad Aigner-Horev , Roi Krakovski

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Combinatorics · Mathematics 2015-10-26 Leonidas Pitsoulis , Eleni-Maria Vretta

If S is a set of matroids, then the matroid M is S-fragile if, for every element e in E(M), either M\e or M/e has no minor isomorphic to a member of S. Excluded-minor characterizations often depend, implicitly or explicitly, on…

Combinatorics · Mathematics 2015-05-01 Carolyn Chun , Deborah Chun , Dillon Mayhew , Stefan H. M. van Zwam

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

Geometric Topology · Mathematics 2026-05-11 Nathan Huber , Ishaan Raghavendra Rao , Hannah Schwartz Joseph , Tanishga Thankaraj Vijay

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam