Tiling randomly perturbed bipartite graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915026119426048 |
|---|---|
| author | Gomez-Leos, Enrique Martin, Ryan R. |
| author_facet | Gomez-Leos, Enrique Martin, Ryan R. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_12738 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tiling randomly perturbed bipartite graphs Gomez-Leos, Enrique Martin, Ryan R. Combinatorics 05C35, 05C70, 05C80 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. |
| title | Tiling randomly perturbed bipartite graphs |
| topic | Combinatorics 05C35, 05C70, 05C80 |
| url | https://arxiv.org/abs/2411.12738 |