scientific article; zbMATH DE number 3933112

From MaRDI portal
Publication:3708045





[For the entire collection see Zbl 0563.00004.] The author reports that Carsten Thomassen asked, as an example of an elementary property one might expect to be forced by large but fixed minimum degree, if every graph with \(\delta >10^{10^{10}}\) contains two disjoint cycles of the same length. The author, in answering this in the affirmative, shows that every 3-regular graph on n vertices contains a set of at least n/64 log\({}^ 2_ 2 n\) pairwise disjoint cycles of the same length, every graph on \(n>2^{5r+10}\) vertices and at least \((2r+2)n\) edges contains a set of r pairwise disjoint cycles, and for \(t\geq 5\) every t-regular graph on n vertices contains a set of at least n(t-4)/2 log\({}^ 2_ 2 n(2t-6)\) pairwise disjoint cycles of the same length.











This page was built for publication:

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