Optimal covers with Hamilton cycles in random graphs (Q484550): Difference between revisions
From MaRDI portal
Latest revision as of 12:32, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal covers with Hamilton cycles in random graphs |
scientific article |
Statements
Optimal covers with Hamilton cycles in random graphs (English)
0 references
7 January 2015
0 references
Given a regular graph \(H\) which is contained in a pseudorandom graph \(G\) and given a pseudorandom subgraph \(J\) of \(G\) which is allowed to be sparse compared to \(H\), the authors find a set of edge-disjoint Hamilton cycles in \(H \cup J\) which cover all edges of \(H\).
0 references
random graphs
0 references
Hamilton cycles
0 references
edge covering
0 references
optimal packing
0 references
0 references
0 references
