H-factors in graphs with small independence number

arXiv2207.03058MaRDI QIDQ6404233FDOQ6404233

Authors: Ming Chen, Jie Han, Guanghui Wang, Donglei Yang 

Publication date: 6 July 2022

Abstract: Let $H$ be an $h$-vertex graph. The vertex arboricity $ar(H)$ of $H$ is the least integer $r$ such that $V(H)$ can be partitioned into $r$ parts and each part induces a forest in $H$. We show that for sufficiently large $ninhmathbbN$, every $n$-vertex graph $G$ with $delta(G)geqmaxleftleft(1-frac2f(H)+o(1)ight)n,left(frac12+o(1)ight)night$ and $alpha(G)=o(n)$ contains an $H$-factor, where $f(H)=2ar(H)$ or $2ar(H)-1$. The result can be viewed an analogue of the Alon--Yuster theorem cite{MR1376050} in Ramsey--Tur'{a}n theory, which generalises the results of Balogh--Molla--Sharifzadeh~cite{MR3570984} and Knierm--Su~cite{MR4193066} on clique factors. In particular the degree conditions are asymptotically sharp for infinitely many graphs $H$ which are not cliques.

This page was built for publication: $H$-factors in graphs with small independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404233)