Long cycles in subgraphs of (pseudo)random directed graphs

Details Long cycles in subgraphs of (pseudo)random directed graphs Long cycles in subgraphs of (pseudo)random directed graphs

2010-09-20

arxiv.org/abs/1009.3721v1

Mathematics

Combinatorics

Scientific paper

We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every $0 < \gamma < 1/2$ we find a constant $c=c(\gamma)$ such that the following holds. Let $G=(V,E)$ be a (pseudo)random directed graph on $n$ vertices, and let $G'$ be a subgraph of $G$ with $(1/2+\gamma)|E|$ edges. Then $G'$ contains a directed cycle of length at least $(c-o(1))n$. Moreover, there is a subgraph $G''$ of $G$ with $(1/2+\gamma-o(1))|E|$ edges that does not contain a cycle of length at least $cn$.

Affiliated with

Also associated with

No associations

Rating

Long cycles in subgraphs of (pseudo)random directed graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Long cycles in subgraphs of (pseudo)random directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long cycles in subgraphs of (pseudo)random directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263882