On induced acyclic subgraphs in sparse random digraphs

MaRDI QIDQ2857365zbMATH OpenFDO

Authors Kunal Dutta, C. R. Subramanian

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001211

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Improved bounds on induced acyclic subgraphs in random digraphs
• Induced acyclic subgraphs in random digraphs: improved bounds
• On the size of induced acyclic subgraphs in random digraphs
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• Largest induced acyclic tournament in random digraphs: a 2-point concentration

Cites work

• Finding induced acyclic subgraphs in random digraphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• On the independence number of random graphs
• On the size of induced acyclic subgraphs in random digraphs
• Random graphs.
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• The probabilistic method

Cited in

(5)

• The covering threshold of a directed acyclic graph by directed acyclic subgraphs
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• Improved bounds on induced acyclic subgraphs in random digraphs
• Induced acyclic subgraphs in random digraphs: improved bounds
• On the size of induced acyclic subgraphs in random digraphs

This page was built for publication: On induced acyclic subgraphs in sparse random digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857365)