Tiling randomly perturbed bipartite graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SWSIDIT2record.jsonopen to challenge →
classification
math.CO
keywords
graphtilingbipartiteperfectperturbedrandomlybaloghbush
read the original abstract
A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for the existence of a perfect $K_{h,h}$-tiling of a randomly perturbed bipartite graph with linear minimum degree.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.