Table of Contents
Fetching ...

On perfect subdivision tilings

Hyunwoo Lee

TL;DR

This work characterizes the asymptotically exact minimum degree threshold for the existence of a perfect $H$-subdivision tiling in every $n$-vertex graph. It introduces a subdivision-aware framework built on the absorption method, the regularity lemma, and domination-based control of the reduced graph, centered around the parameters $\xi(H)$, $\mathrm{hcf}_{\xi}(H)$, and the derived constant $\xi^*(H)$. The main results show that $\delta_{\mathrm{sub}}(n,H) = \left(1 - \frac{1}{\xi^*(H)} + o(1)\right)n$ for all $H$ with at least one edge unless $\mathrm{hcf}_{\xi}(H)=2$, in which case parity of $n$ drives the threshold: $\delta_{\mathrm{sub}}(n,H) = \left(\tfrac{1}{2} + o(1)\right)n$ for odd $n$ and $\delta_{\mathrm{sub}}(n,H) = \left(1 - \frac{1}{\xi^*(H)} + o(1)\right)n$ for even $n$. As concrete corollaries, the results determine $\delta_{\mathrm{sub}}(n,K_r)$ for small $r$ and reveal non-monotonic behavior of subdivision tilings relative to ordinary tilings. The methods combine absorbers of three types, the regularity framework, and domination arguments to manage divisibility and space barriers, offering a versatile approach to subdivision-tiling problems with broad potential applications.

Abstract

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $δ_{\mathrm{sub}}(n, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$, we asymptotically determined the value of $δ_{\mathrm{sub}}(n, H)$. More precisely, for every graph $H$ with at least one edge, there is an integer $\mathrm{hcf}_ξ(H)$ and a constant $1 < ξ^*(H)\leq 2$ that can be explicitly determined by structural properties of $H$ such that $δ_{\mathrm{sub}}(n, H) = \left(1 - \frac{1}{ξ^*(H)} + o(1) \right)n$ holds for all $n$ and $H$ unless $\mathrm{hcf}_ξ(H) = 2$ and $n$ is odd. When $\mathrm{hcf}_ξ(H) = 2$ and $n$ is odd, then we show that $δ_{\mathrm{sub}}(n, H) = \left(\frac{1}{2} + o(1) \right)n$.

On perfect subdivision tilings

TL;DR

This work characterizes the asymptotically exact minimum degree threshold for the existence of a perfect -subdivision tiling in every -vertex graph. It introduces a subdivision-aware framework built on the absorption method, the regularity lemma, and domination-based control of the reduced graph, centered around the parameters , , and the derived constant . The main results show that for all with at least one edge unless , in which case parity of drives the threshold: for odd and for even . As concrete corollaries, the results determine for small and reveal non-monotonic behavior of subdivision tilings relative to ordinary tilings. The methods combine absorbers of three types, the regularity framework, and domination arguments to manage divisibility and space barriers, offering a versatile approach to subdivision-tiling problems with broad potential applications.

Abstract

For a given graph , we say that a graph has a perfect -subdivision tiling if contains a collection of vertex-disjoint subdivisions of covering all vertices of Let be the smallest integer such that any -vertex graph with minimum degree at least has a perfect -subdivision tiling. For every graph , we asymptotically determined the value of . More precisely, for every graph with at least one edge, there is an integer and a constant that can be explicitly determined by structural properties of such that holds for all and unless and is odd. When and is odd, then we show that .
Paper Structure (14 sections, 22 theorems, 23 equations)

This paper contains 14 sections, 22 theorems, 23 equations.

Key Result

Theorem 1.1

Let $H$ be a graph. Then there exists a constant $C = C(H)$, which only depends on $H$, such that any graph $G$ on $n$ vertices with a minimum degree of at least $\mathopen{}\mathclose{\left(1 - \frac{1}{\chi_{cr}(H)} \right)n$ contains an $H$-tiling that covers all but at most $C$ vertices of $G$.

Theorems & Definitions (61)

  • Theorem 1.1: Shokoufandeh and Zhao shokoufandeh2003proof
  • Theorem 1.2: Kühn and Osthus kuhn2009minimum
  • Definition 1.3
  • Definition 1.4
  • Definition 1.5
  • Definition 1.6
  • Definition 1.7
  • Theorem 1.8
  • Theorem 1.9
  • Definition 1.10
  • ...and 51 more