| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651881 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let 0
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
