Related papers: The Circuit-Cocircuit Intersection Conjecture for …
In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…
A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is…
Gaussian correlation conjecture states that the Gaussian measure of the intersection of two symmetric convex sets is greater or equal to the product of the measures.
For a hypergraph $H$, define its intersection spectrum $I(H)$ as the set of all intersection sizes $|E\cap F|$ of distinct edges $E,F\in E(H)$. In their seminal paper from 1973 which introduced the local lemma, Erd\H{o}s and Lov\'asz asked:…
Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…
This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].
Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…
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…
In reference to Werner's measure on self-avoiding loops on Riemann surfaces, Cardy conjectured a formula for the measure of all homotopically nontrivial loops in a finite type annular region with modular parameter $\rho$. Ang, Remy and Sun…
A circle C holds a convex body K if C does not meet the interior of K and if there does not exist any euclidean displacement which moves C as far as desired from K, avoiding the interior of K. The purpose of this note is to explore how…
Las Vergnas Cube Conjecture states that the cube matroid has exactly one class of orientations. We prove that this conjecture is equivalent to saying that the oriented matroid of the affine dependencies of the n-cube can be reconstructed…
Ordinary Coincidence Site Lattices (CSLs) are defined as the intersection of a lattice $\Gamma$ with a rotated copy $R\Gamma$ of itself. They are useful for classifying grain boundaries and have been studied extensively since the mid…
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…
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We prove a similar characterization for 3-connected matroids with modular 4-point lines. We show that such a matroid is either representable…
An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…
The intersection graph $\Delta_G$ of a finite group $G$ is a simple graph with vertices the non-trivial proper subgroups of $G$, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid $L(G)$ are the edge sets of those subgraphs of $G$ that contain at least two cycles, and…
Several matroids can be defined on the edge set of a graph. Although historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s…
We shall be interested in the following Erdos-Ko-Rado-type question. Fix some subset B of [n]. How large a family A of subsets of [n] can we find such that the intersection of any two sets in A contains a cyclic translate (modulo n) of B?…