Universality for transversal Hamilton cycles
Abstract Let be a graph collection on a common vertex set of size such that for every . We show that contains every Hamilton cycle pattern. That is, for every map there is a Hamilton cycle whose th edge lies in .
Authors
- Patrick Morris
- Candida Bowtell
- Katherine Staden (ORCID: https://orcid.org/0000-0002-9968-9148)
- Yanitsa Pehova
Institutions
- The Open University (GB)
- University of Birmingham (GB)
- London School of Economics and Political Science (GB)
- Universitat Politècnica de Catalunya (ES)
Publication Details
- Journal
- Bulletin of the London Mathematical Society
- Published
- 2025-01-10
- DOI
- https://doi.org/10.1112/blms.13223
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Leverhulme Trust
- Deutsche Forschungsgemeinschaft
- Engineering and Physical Sciences Research Council
- European Research Council