Proves a transversal version of Ghouila-Houri's theorem on directed Hamilton cycles in digraph collections, solving an open problem of Chakraborti et al.
We define a vertexv ∈ V is i-good if either Gi is ϵ-extremal and v ∈ V \ (C1 i ∪ C2 i ) or Gi is not ϵ-extremal and dGi(v) ≥ ( 1 2 − ϵ3)n
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Transversal Hamilton cycles in digraph collections
Proves a transversal version of Ghouila-Houri's theorem on directed Hamilton cycles in digraph collections, solving an open problem of Chakraborti et al.