Math 2.0

Resources / preprint

Arc-disjoint Hamiltonian paths in Cayley digraphs with a normal difference subgroup ARZ4X5PXXC

URIm2://res/ARZ4X5PXXC
Kindpreprint
CreatorsSangHyun Park
Date2026-09-27
MSC20-XX, 05-XX
Subjectsarxiv math.GR, arxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-09-27
IdsarXiv 2610.03763, zbl_id 903196309

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Sector fillingstatementlemma 3.3arxiv
One crossing at a local minimumstatementlemma A.2arxiv
Distances between Hamiltonian cut spectrastatementtheorem 1.3arxiv
Four runsstatementlemma 4.3arxiv
Confinementstatementtheorem 4.4arxiv
F7N3R142KAdefinitiondefinition 4.1arxiv
Five runsstatementlemma 4.2arxiv
Three consecutive residuesstatementlemma 5.2arxiv
Terminal cosetsstatementlemma 2.2arxiv
Cycle profile; Curran--Wittestatementproposition 3.2arxiv
Length inequalitystatementlemma 3.4arxiv
M84VJM92GYstatementtheorem 1.1arxiv
P372P49RDBstatementcorollary 5.4arxiv
Units fixing $B$statementlemma 5.3arxiv
RFPS06C6YSstatementproposition 5.1arxiv
Arc forcingstatementlemma 2.1arxiv
Realization of adjacent cutsstatementlemma 2.3arxiv
A cut movestatementlemma A.1arxiv
WEMG2FDKY3statementlemma A.3arxiv
X6F9WFM5BCstatementlemma 3.1arxiv
Exact extension of coset choicesstatementtheorem 1.2arxiv
Exact reduction for fixed choicesstatementproposition 2.4arxiv

Catalogue records