Triangulations of the sphere, bitrades and abelian groups (Q484547): Difference between revisions

In the paper, the following two asymptotic results on partitioning the vertices of 2-edge-colored graphs into monochromatic cycles are proved: Theorem 1: For every positive \(\lambda \) and \(\alpha \,\)there exists \(n_{0}(\lambda,\alpha)\) such that if \(G\) is a \(2\)-colored graph on \(n\geq n_{0}\) vertices, then there are at most \(2\alpha \) vertex disjoint monochromatic cycles covering at least \((1-\lambda)n\) vertices of \(G\), where \(\alpha \) is the independence number of \(G\). Theorem 2: For every \(\varepsilon >0,\) there is an \(n_{0}(\varepsilon)\) such that if \(G\) is a \(2\)-colored graph on \(n\geq n_{0}\) vertices and \(\delta (G)>(\frac{3}{4}+\varepsilon)n\), then \(G\) admits two vertex disjoint monochromatic cycles of different colors covering at least \((1-\varepsilon)n \) vertices of \(G\).