REVIEW 12 cited by
The existence of designs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The existence of designs
read the original abstract
We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853. More generally, we show that the natural divisibility conditions are sufficient for clique decompositions of simplicial complexes that satisfy a certain pseudorandomness condition. As a further generalisation, we obtain the same conclusion only assuming an extendability property and the existence of a robust fractional clique decomposition.
Forward citations
Cited by 12 Pith papers
-
A Proof of Nash-Williams' Conjecture
The authors prove that every triangle-divisible graph on n vertices with minimum degree at least (3/4)n has a triangle decomposition for large n.
-
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Proves a rainbow blow-up lemma for almost optimally bounded edge-colorings, implying existence of rainbow copies of any bounded-degree spanning subgraph in a quasirandom host graph under an asymptotically best-possibl...
-
Perfectly packing graphs with bounded degeneracy and many leaves
Proves that bounded-degeneracy graphs with many leaves pack perfectly into dense quasirandom graphs under stated degree and size conditions, settling two tree-packing conjectures for almost all instances.
-
Linear Tur\'an Numbers of Uniform Hypertrees
For several r-uniform linear hypertrees with four edges, the maximum number of edges in a linear r-uniform hypergraph avoiding them is determined; the 4-uniform 4-edge path case is settled exactly.
-
On cliques in hypergraphs under bounded $(j,p)$-norm
Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.
-
Universality for rainbow oriented cycles in perturbed digraphs
Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.
-
On the Tur\'an number of blow-ups of $\mathcal{F}_5$
The paper computes the exact Turán number ex(n, F5(f3;t)) for the blow-up of f3 in F5 and shows exponentially many extremal constructions, plus general bounds and exact values for other blow-ups including F_sim(t).
-
Fractional clique decompositions of dense balanced multipartite graphs
New explicit degree thresholds are established for fractional K_s-decompositions of balanced multipartite graphs when the number of parts exceeds the clique size.
-
Fractional clique decompositions of dense balanced multipartite graphs
Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.
-
Short proofs of three combinatorial results in the Johnson scheme
Short proofs are supplied for three results on (n,k,L)-systems in the Johnson scheme, the central one being a proof of the Aljohani-Bamberg-Cameron conjecture that complementary systems whose sizes multiply to binom(n...
-
Delta-system method: a survey
A survey of the Delta-system (sunflower) method in extremal set theory, with proofs of key theorems and a broad literature review.
-
Entropy methods in combinatorics
A selective survey of entropy methods in combinatorics, detailing randomized chain rules, Shearer's inequality, random homomorphisms, Pinsker-type arguments, the union-closed sets breakthrough, and entropy approaches ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.