2024
DOI: 10.1017/s0963548324000130
|View full text |Cite
|
Sign up to set email alerts
|

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs

Kyriakos Katsamaktsis,
Shoham Letzter,
Amedeo Sgueglia

Abstract: We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every $\delta \in (0,1)$ there exists $C = C(\delta ) \gt 0$ such that the following holds. Let $D_0$ be an $n$ -vertex digraph with minimum semidegree at least $\delta n$ and suppose that each edge of the union of $D_0$… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 22 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?