Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
DOI10.1090/tran/8954zbMath1520.05089arXiv2206.14472OpenAlexW4362607184MaRDI QIDQ6135844
Tom Kelly, Abhishek Methuku, Daniela Kühn, Dong Yeap Kang, Deryk Osthus
Publication date: 28 August 2023
Full work available at URL: https://arxiv.org/abs/2206.14472
Steiner triple systemLatin squarerandom graph1-factorizationthresholdblock designrandom hypergraphtriangle decompositionShamir's problemspreadness
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of block designs (05B05) Combinatorial probability (60C05) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring complete and complete bipartite graphs from random lists
- Combinatorial and computational aspects of graph packing and graph decomposition
- An upper bound on the number of high-dimensional permutations
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- On a packing and covering problem
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- The solution of van der Waerden's problem for permanents
- On the combinatorial problems which I would most like to see solved
- Nearly perfect matchings in regular simple hypergraphs
- The list chromatic index of a bipartite multigraph
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Thresholds versus fractional expectation-thresholds
- Number of 1-factorizations of regular high-degree graphs
- Fractional clique decompositions of dense graphs and hypergraphs
- On a hypergraph matching problem
- Factors in random graphs
- A Census of Small Latin Hypercubes
- Sharp thresholds of graph properties, and the $k$-sat problem
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Hunting for sharp thresholds
- Pseudorandom hypergraph matchings
- Extremal aspects of graph and hypergraph decomposition problems
- Minimalist designs
- On the threshold problem for Latin boxes
- Sublinear Algorithms for (Δ + 1) Vertex Coloring
- Edge-disjoint Hamilton cycles in random graphs
- On the existence of a factor of degree one of a connected random graph
- The Solution of a Timetabling Problem
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Threshold for Steiner triple systems
This page was built for publication: Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
