REVIEW 2 cited by
A robust version of the multipartite Hajnal--Szemer\'edi theorem
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
abstract
In this note we show the following strengthening of a multipartite version of the Hajnal--Szemer\'edi theorem. For an integer $r \ge 3$ and $\gamma > 0$, there exists a constant $C$ such that if $p\ge Cn^{-2/r}(\log n)^{1/{r \choose 2}}$ and $G$ is a balanced $r$-partite graph with each vertex class of size $n$ and $\delta^\ast(G)\ge (1-1/r+\gamma)n$, then with high probability the random subgraph $G(p)$ of $G$ contains a $K_r$-factor. We also use it to derive corresponding transversal versions.
Forward citations
Cited by 2 Pith papers
-
Transversal packings in families of percolated hypergraphs
For any strictly 1-balanced k-graph F, k-graph systems above the transversal Dirac threshold with high probability contain a transversal F-factor after independent random sparsification at p = Ω(n^{-1/d1(F)-1} (log n)^{1/t}).
-
Transversal Structures in Graph Systems: A Survey
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.
Discussion (0). Sign in to comment.