Login / Signup

The size of the largest hole in a random graph.

Tomasz Luczak
Published in: Discret. Math. (1993)
Keyphrases
  • random graphs
  • graph theoretic
  • computational complexity
  • information extraction