Related papers: Strongly minimal Steiner Systems III: Path graphs …
Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…
We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…
A spanner is a sparse subgraph of a given graph $G$ which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses the problem of constructing graph spanners w.r.t.\ the group…
Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid…
We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…
Seminal works on light spanners over the years provide spanners with optimal lightness in various graph classes, such as in general graphs, Euclidean spanners, and minor-free graphs. Three shortcomings of previous works on light spanners…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
In this work we take a step towards characterising strongly flip-flat classes of graphs. Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting of dense classes of graphs. We prove that strongly flip-flat…
Szemer\'edi's Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of the Regularity Lemma for sparse graphs, but these only apply when the graph satisfies some local density condition. In…
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…
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) <=…
We systematically obtain all linear models which propagate a totally symmetric rank-three field without parity violation on a flat background. Each such model is defined exclusively by its gauge symmetry, a necessary property of effective…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when $\c < {\aleph}_{\omega}$, we construct a weakly tight family under the hypothesis $\s \leq \b < {\aleph}_{\omega}$. The case when…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first establish necessary and sufficient conditions for the…
We give necessary and sufficient conditions for the Terwilliger algebra of a quasi-thin Schurian association scheme to coincide with: (a) the centralizer algebra of a point stabilizer of its automorphism group, and (b) its subspace $T^0$.…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
For a given stationary set $S$ of countable ordinals we prove (in $\mathbf{ZFC}$) that the assertion "every $S$-ladder system has $\aleph_0$-uniformization" is equivalent to "every strongly $\aleph_1$-free abelian group of cardinality…
We establish a general version of the Siegel-Sternberg linearization theorem for ultradiffentiable maps which includes the analytic case, the smooth case and the Gevrey case. It may regarded as a small divisior theorem without small divisor…