Long cycles in subgraphs of (pseudo)random directed graphs
Long cycles in subgraphs of (pseudo)random directed graphs
Abstract We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every 08γ81/2 we find a constant c = c (γ) such that the following holds. Let G = ( V, E ) be a (pseudo)random directed graph on …