Robust Hamiltonicity of random directed graphs

被引:11
|
作者
Ferber, Asaf [1 ]
Nenadov, Rajko [1 ]
Noever, Andreas [1 ]
Peter, Ueli [1 ]
Skoric, Nemanja [1 ]
机构
[1] Swiss Fed Inst Technol, Inst Theoret Comp Sci, CH-8092 Zurich, Switzerland
关键词
Random digraphs; Directed Hamilton cycle; Local resilience; LOCAL RESILIENCE; THEOREM; CYCLES;
D O I
10.1016/j.jctb.2017.03.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In his seminal paper from 1952 Dirac showed that the complete graph on n >= 3 vertices remains Hamiltonian even if we allow an adversary to remove left perpendicular n/2 right perpendicular edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on n >= 3 vertices with minimum in- and out-degree at least n/2 contains a directed Hamilton cycle. Both statements quantify the robustness of complete graphs (digraphs) with respect to the property of containing a Hamilton cycle. A natural way to generalize such results to arbitrary graphs (digraphs) is using the notion of local resilience. The local resilience of a graph (digraph) G with respect to a property P is the maximum number r such that G has the property P even if we allow an adversary to remove an r-fraction of (in and out-going) edges touching each vertex. The theorems of Dirac and Ghouila-Houri state that the local resilience of the complete graph and digraph with respect to Hamiltonicity is 1/2. Recently, this statements have been generalized to random settings. Lee and Sudakov (2012) proved that the local resilience of a random graph with edge probability p = omega (logn/n) with respect to Hamiltonicity is 1/2 +/- o(1). For random directed graphs, Hefetz, Steger and Sudakov (2014) proved an analogue statement, but only for edge probability p = w (log n/root n). In this paper we significantly improve their result to p = omega (log(8)n/n), which is optimal up to the poly logarithmic factor. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:1 / 23
页数:23
相关论文
共 50 条
  • [1] Hamiltonicity in random directed graphs is born resilient
    Montgomery, Richard
    COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (06): : 900 - 942
  • [2] On the Hamiltonicity of random bipartite graphs
    Yilun Shang
    Indian Journal of Pure and Applied Mathematics, 2015, 46 : 163 - 173
  • [3] ON THE HAMILTONICITY OF RANDOM BIPARTITE GRAPHS
    Shang, Yilun
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2015, 46 (02): : 163 - 173
  • [4] ROBUST HAMILTONICITY OF DIRAC GRAPHS
    Krivelevich, Michael
    Lee, Choongbum
    Sudakov, Benny
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2014, 366 (06) : 3095 - 3130
  • [5] Hamiltonicity in random graphs is born resilient
    Montgomery, Richard
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 139 : 316 - 341
  • [6] RESILIENCE WITH RESPECT TO HAMILTONICITY IN RANDOM GRAPHS
    Condon, P.
    Diaz, A. Espuny
    Girao, A.
    Kim, J.
    Kuhn, D.
    Osthus, D.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 547 - 551
  • [7] Directed graphs, hamiltonicity and doubly stochastic matrices
    Borkar, VS
    Ejov, V
    Filar, JA
    RANDOM STRUCTURES & ALGORITHMS, 2004, 25 (04) : 376 - 395
  • [8] Sharp thresholds for Hamiltonicity in random intersection graphs
    Efthymiou, Charilaos
    Spirakis, Paul G.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (40-42) : 3714 - 3730
  • [9] HAMILTONICITY OF RANDOM GRAPHS IN THE STOCHASTIC BLOCK MODEL
    Anastos, Michael
    Frieze, Alan
    Gao, Pu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (03) : 1854 - 1880
  • [10] Hamiltonicity of graphs perturbed by a random regular graph
    Diaz, Alberto Espuny
    Girao, Antonio
    RANDOM STRUCTURES & ALGORITHMS, 2023, 62 (04) : 857 - 886