## Abstract

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let 0n,p. Let odd(G) be the number of odd degree vertices in G. Then a.a.s. the following hold:(i)G can be decomposed into δ(G)/2 cycles and a matching of size odd(G)/2.(ii)G can be decomposed into max {odd(G)/2, ⌈δ(G)/2⌉} paths.(iii)G can be decomposed into ⌈δ(G)/2⌉linear forests. Each of these bounds is best possible. We actually derive (i)-(iii) from 'quasi-random' versions of our results. In that context, we also determine the edge chromatic number of a given dense quasirandom graph of even order. For all these results, our main tool is a result on Hamilton decompositions of robust expanders by Kühn and Osthus.

Original language | English |
---|---|

Pages (from-to) | 65-72 |

Number of pages | 8 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 49 |

DOIs | |

Publication status | Published - 1 Nov 2015 |

## Keywords

- Cycle decomposition
- Linear arboricity
- Overfull subgraph conjecture
- Path decomposition

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics