Pith. sign in

REVIEW 1 cited by

Universality for transversal Hamilton cycles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.04138 v2 pith:2DZ5A62I submitted 2023-10-06 math.CO

Universality for transversal Hamilton cycles

classification math.CO
keywords everyhamiltoncyclemathbfcollectioncommoncontainscycles
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Let $\mathbf{G}=\{G_1, \ldots, G_m\}$ be a graph collection on a common vertex set $V$ of size $n$ such that $\delta(G_i) \geq (1+o(1))n/2$ for every $i \in [m]$. We show that $\mathbf{G}$ contains every Hamilton cycle pattern. That is, for every map $\chi: [n] \to [m]$ there is a Hamilton cycle whose $i$-th edge lies in $G_{\chi(i)}$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Transversal Structures in Graph Systems: A Survey

    math.CO 2024-12 unverdicted novelty 2.0

    Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.