Related papers: Cancellative hypergraphs and Steiner triple system…

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

An $r$-graph is a triangle if there exists a positive integer $i \le \lceil r/2 \rceil$ such that it is isomorphic to the following $r$-graph with three edges: \begin{align*} \left\{\{1, \ldots, r\},~\{1, \ldots, i, r+1, \ldots,…

This article investigates the relation between the distributional chaos and the existence of a scrambled triple. We show that for a continuous mapping $f$ acting on a compact metric space $(X,d)$, the possession of an infinite extremal…

Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing that $S(t,k,n)$ exists whenever the necessary divisibility conditions on the parameters are satisfied and $n$ is sufficiently large in terms…

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…

The stability number of a forbidden family measures how many different structures are needed to approximate all near-extremal constructions avoiding it. An infinite stability number means that no finite list of structures suffices. We…

Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the…

We prove that for any infinite field homology stability for the third integral homology of the special linear groups $SL(n,F)$ begins at $n=3$. When $n=2$ the cokernel of the map from the third homology of $SL(2,F)$ to the third homology of…

A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…

In this paper we present a construction of stable bundles on Calabi-Yau threefolds using the method of bundle extensions. This construction applies to any given Calabi-Yau threefold with h^{1,1}>1. We give examples of stable bundles of rank…

Let $(C,\underline{w})$ be a polarized nodal reducible curve. In this paper we consider coherent systems of type $(r,d,k)$ on $C$ with $k < r$. We prove that the moduli spaces of $(\underline{w},\alpha)$-stable coherent systems stabilize…

A linear system of plane curves satisfying multiplicity conditions at points in general position is called special if the dimension is larger than the expected dimension. A (-1) curve is an irreducible curve with self intersection -1 and…

Given graphs $G_1,\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal…

We consider linear stability of steady states of 1(1/2) and 3D Vlasov-Maxwell systems for collisionless plasmas. The linearized systems can be written as separable Hamiltonian systems with constraints. By using a general theory for…

In this technical communique we study the maximal robust positively invariant set for state-constrained continuous-time nonlinear systems subjected to a bounded disturbance. Extending results from the theory of barriers, we show that this…

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…

A hypergraph $\mathcal{F}$ is non-trivial intersecting if every two edges in it have a nonempty intersection but no vertex is contained in all edges of $\mathcal{F}$. Mubayi and Verstra\"{e}te showed that for every $k \ge d+1 \ge 3$ and $n…

We characterize permanence of planar S-systems. Further, we construct a planar S-system with three limit cycles.

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…