Finding induced acyclic subgraphs in random digraphs

MaRDI QIDQ1422133zbMATH OpenFDO

Authors C. R. Subramanian

Publication date 5 February 2004

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123241, http://www.emis.de/journals/EJC/Volume_10/Abstracts/v10i1r46.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

optimization

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms (68W40)

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
• Largest induced acyclic tournament in random digraphs: a 2-point concentration
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms

Cited in

(6)

• On the size of induced acyclic subgraphs in random digraphs
• A classification of isomorphism-invariant random digraphs
• Improved bounds on induced acyclic subgraphs in random digraphs
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• 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: Finding 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 Q1422133)