06118541

j

06118541 Kostochka, Alexandr V. Yu, Gexin Graphs containing every 2-factor. Graphs Comb. 28, No. 5, 687-716 (2012). 2012 Springer-Verlag, Tokyo EN graph packing ore-type degree conditions 2-factors

doi:10.1007/s00373-011-1066-6

Summary: For a graph $G$, let ${\sigma_2(G)=\min\{d(u)+d(v):uv\notin E(G)\}}$. We prove that every $n$-vertex graph $G$ with $\sigma _{2}(G) \geq 4n/3 - 1$ contains each 2-regular $n$-vertex graph. This extends a theorem due to Aigner and Brandt and to Alon and Fisher.