相关论文: A Simple Condition for the Existence of Transversa…

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…

An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…

Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. How large does $\alpha$ need to be to guarantee that $G$ contains a connected transversal, that is, a tree on $r$ vertices meeting each…

Let $\mathcal F$ be a family of compact convex sets in $\mathbb R^d$. We say that $\mathcal F $ has a \emph{topological $\rho$-transversal of index $(m,k)$} ($\rho<m$, $0<k\leq d-m$) if there are, homologically, as many transversal…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…

We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$,…

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

The transversal number $\tau(H)$ of a hypergraph $H$ is the minimum number of vertices that intersect every edge of $H$. A linear hypergraph is one in which every two distinct edges intersect in at most one vertex. A $k$-uniform hypergraph…

We consider a set-valued mapping on a simple graph and ask for the existence of a disparate selection. The term disparate is defined in the paper and we present a sufficient and necessary condition for the existence of a disparate…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

We prove an existence theorem for the sliding boundary variant of the Plateau problem for $2$-dimensional sets in $\mathbb{R}^n$. The simplest case of sufficient condition is when $n=3$ and the boundary $\Gamma$ is a finite disjoint union…

Given graphs $G_1,\ldots,G_s$ all on the same vertex set and a graph $H$ with $e(H) \leq s$, a copy of $H$ is transversal or rainbow if it contains at most one edge from each $G_c$. When $s=e(H)$, such a copy contains exactly one edge from…

It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizations of these classical results. For a collection…

Given a finite abelian group $G$ and cyclic subgroups $A$, $B$, $C$ of $G$ of the same order, we find necessary and sufficient conditions for $A$, $B$, $C$ to admit a common transversal for the cosets they afford. For an arbitrary number of…

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…

The {\em bipartite-hole-number} of a graph $G$, denoted as $\widetilde\alpha(G)$, is the minimum number $k$ such that there exist integers $a$ and $b$ with $a + b = k+1$ such that for any two disjoint sets $A, B \subseteq V(G)$, there is an…