English
Related papers

Related papers: Threshold for Steiner triple systems

200 papers

We find the threshold for the existence of a collection of edge disjoint copies of $K_r$ that form a cyclic structure and span all vertices of $G_{n,p}$. We use a recent result of Riordan to give a two line proof of the main result.

Combinatorics · Mathematics 2020-06-01 Alan Frieze

We consider Bridgeland stability conditions for three-folds conjectured by Bayer-Macr\`i-Toda in the case of Picard rank one. We study the differential geometry of numerical walls, characterizing when they are bounded, discussing possible…

Algebraic Geometry · Mathematics 2026-01-07 Marcos Jardim , Antony Maciocia

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

Combinatorics · Mathematics 2014-05-27 Richard Montgomery

It was proved in 2009 that any partial Steiner triple system of order $u$ has an embedding of order $v$ for each admissible integer $v\geq 2u+1$. This result is best-possible in the sense that, for each $u\geq 9$, there exists a partial…

Combinatorics · Mathematics 2014-02-13 Daniel Horsley

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper $3$-system $(P_{1},P_{2},P_{3})$ with the property $\overline{\varphi}_{3}=1$. In fact, our method generalizes to provide $n$-systems with…

Number Theory · Mathematics 2021-01-12 Johannes Schleischitz

This work proposes a bootstrapping with positivity methodology to study random $U(N)^{D}$ invariant tensors in the large $N$ limit. As has been done for $U(N)$ invariant random matrices, we combine the Dyson-Schwinger equations and…

High Energy Physics - Theory · Physics 2026-04-22 Nathan Pagliaroli , Carlos I. Pérez-Sánchez , Brayden Smith

The pasch configuration and Steiner triple systems

Combinatorics · Mathematics 2013-06-07 Masood Aryapoor

A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…

Combinatorics · Mathematics 2016-04-01 Marco Buratti , Gloria Rinaldi , Tommaso Traetta

Using Easton collapses, we give a simplified construction of a model in which Chang's Conjecture for triples holds.

Logic · Mathematics 2024-02-16 Monroe Eskew , Masahiro Shioya

We state, discuss, provide evidence for, and prove in special cases the conjecture that the probability that a random tiling by rhombi of a hexagon with side lengths $2n+a,2n+b,2n+c,2n+a,2n+b,2n+c$ contains the (horizontal) rhombus with…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian…

Combinatorics · Mathematics 2022-01-11 Eyal Lubetzky , Yuval Peled

Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and R\"{o}dl conjectured that for any given $\mu>0$, there exists $n_0$ such that the following holds. Every $n$-vertex Steiner triple system…

Combinatorics · Mathematics 2022-08-23 Seonghyuk Im , Jaehoon Kim , Joonkyung Lee , Abhishek Methuku

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

Computational Complexity · Computer Science 2023-11-07 Kevin Pratt

It is known that in any $r$-coloring of the edges of a complete $r$-uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on $n$ vertices, what is the largest monochromatic component one can…

Combinatorics · Mathematics 2020-02-11 Louis DeBiasio , Michael Tait

We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…

Data Structures and Algorithms · Computer Science 2008-08-15 Ittai Abraham , Yair Bartal , Ofer Neiman

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

Combinatorics · Mathematics 2007-05-23 Jeff Kahn , Gil Kalai

The processes with three or more charged particles in the final state exhibit particular threshold behavior, as inferred by the famous Wannier law for (2e + ion) system. We formulate a general solution which determines the threshold…

Atomic Physics · Physics 2009-10-31 M. Yu. Kuchiev , V. N. Ostrovsky

For a spectrally positive and strictly stable process with index in (1,2), a series representation is obtained for the joint distribution of the "first passage triple" that consists of the time of first passage and the undershoot and the…

Probability · Mathematics 2019-04-04 Zhiyi Chi

In this article, we construct a Steiner system with the parameters $S(3,6,42)$, settling one of the smallest open parameter sets of Steiner $3$-designs. Furthermore, we establish the existence of rotational Steiner quadruple systems on $46$…

Combinatorics · Mathematics 2025-09-30 Michael Kiermaier , Vedran Krčadinac , Alfred Wassermann

The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of $p$ is $p+1$. We study the fibonomial triangle mod 5, showing with a…

Number Theory · Mathematics 2016-04-19 Jeremiah Southwick