Optimal covers with Hamilton cycles in random graphs (Q484550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal covers with Hamilton cycles in random graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8617070317268372
0 references
0.8584476709365845
0 references
0.8240818977355957
0 references
0.8233140110969543
0 references
0.8145474195480347
0 references
