English

Spanning subdivisions in Dirac graphs

Combinatorics 2023-09-13 v2

Abstract

We show that for every nNn\in\mathbb N and logndn\log n\le d\le n, if a graph GG has N=Θ(dn)N=\Theta(dn) vertices and minimum degree (1+o(1))N2(1+o(1))\frac{N}{2}, then it contains a spanning subdivision of every nn-vertex dd-regular graph.

Keywords

Cite

@article{arxiv.2306.03994,
  title  = {Spanning subdivisions in Dirac graphs},
  author = {Matías Pavez-Signé},
  journal= {arXiv preprint arXiv:2306.03994},
  year   = {2023}
}
R2 v1 2026-06-28T10:58:13.754Z