On the size of induced acyclic subgraphs in random digraphs

zbMATH Open1196.05091MaRDI QIDQ3575422FDOQ3575422

Authors: C. R. Subramanian, Joel Spencer 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/453/0.html

Recommendations

• Improved bounds on induced acyclic subgraphs in random digraphs
• On induced acyclic subgraphs in sparse random digraphs
• Induced acyclic subgraphs in random digraphs: improved bounds
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• Finding induced acyclic subgraphs in random digraphs

zbMATH Keywords

random digraphsinduced acyclic subgraphs

Mathematics Subject Classification ID

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

Cited In (7)

• Two results on the digraph chromatic number
• Finding induced acyclic subgraphs in random digraphs
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• Induced acyclic subgraphs in random digraphs: improved bounds
• Improved bounds on induced acyclic subgraphs in random digraphs
• On induced acyclic subgraphs in sparse random digraphs
• Largest induced acyclic tournament in random digraphs: a 2-point concentration

This page was built for publication: On the size of induced acyclic subgraphs in random digraphs

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