Paper Info
Title
On The Size Of Induced Acyclic Subgraphs In Random Digraphs
Abstract
Let D epsilon D(n, p) denote a simple random digraph obtained by choosing each of the ((n)(2)) undirected edges independently with probability 2p and then orienting each chosen edge independently in one of the two directions with equal probability 1/2. Let mas(D) denote the maximum size of an induced acyclic subgraph in D. We obtain tight concentration results on the size of mas(D). Precisely, we show thatmas(D) <= 2/ln(1-p)(-1) (ln np + 3e)almost surely, provided p >= W/n for some fixed constant W. This combined with known and new lower bounds shows that (for p satisfying p = omega(1/ n) and p <= 0.5)mas(D) = 2(ln np)/ln(1-p)(-1) (1 +/- o(1)).This proves a conjecture stated by Subramanian in 2003 for those p such that p = omega(1/n). Our results are also valid for the random digraph obtained by choosing each of the n(n-1) directed edges independently with probability p.
Year
Venue
Keywords
2008
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
induced acyclic subgraphs, random digraphs
Field
DocType
Volume
Discrete mathematics,Combinatorics,Simple random sample,Almost surely,Conjecture,Mathematics,Digraph
Journal
10
Issue
ISSN
Citations 
2
1462-7264
6
PageRank 
References 
Authors
0.59
2
2
Name
Order
Citations
PageRank
Joel Spencer1414.73
C. R. Subramanian260.59