Hamilton Powers of Eulerian Digraphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Colón, Enrico Celestino, Urschel, John
Format: Preprint
Publié: 2022
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910466145517568
author Colón, Enrico Celestino
Urschel, John
author_facet Colón, Enrico Celestino
Urschel, John
contents In this note, we prove that the $\lceil \tfrac{1}{2} \sqrt{n} \log_2^2 n \rceil^{th}$ power of a connected $n$-vertex Eulerian digraph is Hamiltonian, and provide an infinite family of digraphs for which the $\lfloor \sqrt{n}/2 \rfloor^{th}$ power is not.
format Preprint
id arxiv_https___arxiv_org_abs_2210_10259
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Hamilton Powers of Eulerian Digraphs
Colón, Enrico Celestino
Urschel, John
Combinatorics
05C20 (Primary) 05C45 (Secondary)
In this note, we prove that the $\lceil \tfrac{1}{2} \sqrt{n} \log_2^2 n \rceil^{th}$ power of a connected $n$-vertex Eulerian digraph is Hamiltonian, and provide an infinite family of digraphs for which the $\lfloor \sqrt{n}/2 \rfloor^{th}$ power is not.
title Hamilton Powers of Eulerian Digraphs
topic Combinatorics
05C20 (Primary) 05C45 (Secondary)
url https://arxiv.org/abs/2210.10259