Sequentially constrained Hamilton cycles in random graphs
Combinatorics
2023-11-08 v4
Abstract
We discuss the existence of Hamilton cycles in the random graph where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order and (iii) there is a bound on the number of inversions in the associated permutation.
Cite
@article{arxiv.2305.00880,
title = {Sequentially constrained Hamilton cycles in random graphs},
author = {Alan Frieze and Wesley Pegden},
journal= {arXiv preprint arXiv:2305.00880},
year = {2023}
}