ملخص
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on n vertices with minimum out-degree and in-degree at least n/2 contains a directed Hamilton cycle. In this paper we extend this theorem to a random directed graph D(n,p), that is, a directed graph in which every ordered pair (u, v) becomes an arc with probability p independently of all other pairs. Motivated by the study of resilience of properties of random graphs, we prove that if p ≫ log n/√n, then a.a.s. every subdigraph of D(n,p) with minimum out-degree and in-degree at least (1/2+o(1))np contains a directed Hamilton cycle. The constant 1/2 is asymptotically best possible. Our result also strengthens classical results about the existence of directed Hamilton cycles in random directed graphs.
| اللغة الأصلية | الإنجليزيّة |
|---|---|
| الصفحات (من إلى) | 345-362 |
| عدد الصفحات | 18 |
| دورية | Random Structures and Algorithms |
| مستوى الصوت | 49 |
| رقم الإصدار | 2 |
| المعرِّفات الرقمية للأشياء | |
| حالة النشر | نُشِر - 1 سبتمبر 2016 |
| منشور خارجيًا | نعم |
بصمة
أدرس بدقة موضوعات البحث “Random directed graphs are robustly Hamiltonian'. فهما يشكلان معًا بصمة فريدة.قم بذكر هذا
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver