Related papers: More nonexistence results for symmetric pair cover…
An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…
Given five positive integers $v, m,k,\lambda$ and $t$ where $v \geq k \geq t$ and $v \geq m \geq t,$ a $t$-$(v,k,m,\lambda)$ general covering design is a pair $(X,\mathcal{B})$ where $X$ is a set of $v$ elements (called points) and…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
We show the abundance theorem for arithmetic klt threefold pairs whose closed point have residue characteristic greater than five. As a consequence, we give a sufficient condition for the asymptotic invariance of plurigenera for certain…
A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of…
We address an old (1977) conjecture of a subset of the authors (a variant of Ryser's conjecture): in every r-coloring of the edges of a biclique [A,B] (complete bipartite graph), the vertex set can be covered by the vertices of at most 2r-2…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
A $(v,k,\lambda)$-BIBD $(X,\mathcal B)$ can be nested if there is a mapping $\phi:\mathcal B\rightarrow X$ such that $(X,\{B\cup\{\phi(B)\}\mid B\in\mathcal B\})$ is a $(v,k+1,\lambda+1)$-packing. A $(v,k,\lambda)$-BIBD has a (perfect)…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
Let V be a rank N vector bundle on a d-dimensional complex projective scheme X; assume that V is equipped with a skew-symmetric bilinear form with values in a line bundle L and that \Lambda^2 V^* \otimes L is ample. Suppose that the maximum…
Fisher proved in 1940 that any $2$-$(v,k,\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\lambda)$ design with $v \geq k+\lfloor t/2 \rfloor$ has…
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a different definition of a burl from the journal version of…
We begin the study of collections of three blocks which can occur in a symmetric configuration with block size 3, $v_3$. Formulae are derived for the number of occurrences of these and it is shown that the triangle, i.e. abf, ace, bcd is a…
A graph is $n$-existentially closed ($n$-e.c.) if for any disjoint subsets $A$, $B$ of vertices with $|{A \cup B}|=n$, there is a vertex $z \notin A \cup B$ adjacent to every vertex of $A$ and no vertex of $B$. For a block design with block…
We prove that a cyclic cover of a smooth complex projective variety is Brody hyperbolic if its branch divisor is a generic small deformation of a large enough multiple of a Brody hyperbolic base-point-free ample divisor. We also show the…
O. Brunat and J. Gramain recently proved that any two blocks of double covers of symmetric groups are Brou\'{e} perfectly isometric provided they have the same weight and sign. They also proved a corresponding statement for double covers of…
Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…
Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic…