Partitioning random graphs into large cycles

From MaRDI portal





Let G be a graph chosen randomly from the set of graphs with \(m=m(n)\) edges on n vertices. For any fixed integer r, the probability that G can be partitioned equitably into r cycles is given for \(n\to \infty\).











This page was built for publication: Partitioning random graphs into large cycles

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