We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge-disjoint from the other one.
Hamilton paths with lasting separation / Fachini, Emanuela; Korner, Janos. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - STAMPA. - 63:10(2017), pp. 6344-6346. [10.1109/TIT.2017.2738631]
Hamilton paths with lasting separation
Fachini, Emanuela;Korner, Janos
2017
Abstract
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge-disjoint from the other one.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Fachini_Hamilton_2017.pdf
accesso aperto
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
95.4 kB
Formato
Adobe PDF
|
95.4 kB | Adobe PDF | |
|
Fachini_Hamilton_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
122.01 kB
Formato
Adobe PDF
|
122.01 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
