On directed versions of the Corrádi-Hajnal corollary

From MaRDI portal
(Redirected from Publication:404438)




Abstract: For kinmathbbN, Corr'adi and Hajnal proved that every graph G on 3k vertices with minimum degree delta(G)ge2k has a C3-factor, i.e., a partitioning of the vertex set so that each part induces the 3-cycle C3. Wang proved that every directed graph overrightarrowG on 3k vertices with minimum total degree deltat(overrightarrowG):=minvinV(deg(v)+deg+(v))ge3(3k1)/2 has a overrightarrowC3-factor, where overrightarrowC3 is the directed 3-cycle. The degree bound in Wang's result is tight. However, our main result implies that for all integers age1 and bge0 with a+b=k, every directed graph overrightarrowG on 3k vertices with minimum total degree deltat(overrightarrowG)ge4k1 has a factor consisting of a copies of overrightarrowT3 and b copies of overrightarrowC3, where overrightarrowT3 is the transitive tournament on three vertices. In particular, using b=0, there is a overrightarrowT3-factor of overrightarrowG, and using a=1, it is possible to obtain a overrightarrowC3-factor of overrightarrowG by reversing just one edge of overrightarrowG. All these results are phrased and proved more generally in terms of undirected multigraphs. We conjecture that every directed graph overrightarrowG on 3k vertices with minimum semidegree delta0(overrightarrowG):=minvinVmin(deg(v),deg+(v))ge2k has a overrightarrowC3-factor, and prove that this is asymptotically correct.









This page was built for publication: On directed versions of the Corrádi-Hajnal corollary

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