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

In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two…

A \textit{$k$-transversal} to family of sets in $\mathbb{R}^d$ is a $k$-dimensional affine subspace that intersects each set of the family. In 1957 Hadwiger provided a necessary and sufficient condition for a family of pairwise disjoint,…

Let $\mathbf{G}=\{G_1,\dots,G_{s}\}$ be a collection of $s$ bipartite graphs with the same bipartition $V=(X,Y)$. For a path $P$ with $V(P)=V$ and $|E(P)|=s$, if there exists an injection $\phi$: $E(P)\rightarrow [s]$ such that $e\in…

Two mesh patterns are coincident if they are avoided by the same set of permutations. In this paper, we provide necessary conditions for this coincidence, which include having the same set of enclosed diagonals. This condition is sufficient…

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

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

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and…

Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…

We introduce a geometric generalization of Hall's marriage theorem. For any family $F = \{X_1, \dots, X_m\}$ of finite sets in $\mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_i\in X_i$ for every $1\leq i…

Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane…

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

Konig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation of this result, in which each point in one side of the graph is replaced by a subtree of a given tree. The…

We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical…

Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is…

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

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

Given a binary quasigroup $G$ of order $n$, a $d$-iterated quasigroup $G[d]$ is the $(d+1)$-ary quasigroup equal to the $d$-times composition of $G$ with itself. The Cayley table of every $d$-ary quasigroup is a $d$-dimensional latin…

We find Dirac-type sufficient conditions for a hypergraph $\mathcal H$ with few edges to be hamiltonian. We also show that these conditions provide that $\mathcal H$ is {\em super-pancyclic}, i.e., for each $A \subseteq V(\mathcal H)$ with…