binomial random graph

← Encyclopedia

External reading guide · Undergraduate

Choosing each edge independently gives a graph model in which subgraph counts can be estimated by expectation. The deletion argument converts those estimates into deterministic graphs avoiding a prescribed subgraph.

Before opening the references

Finite Simple Graph · Independent Events · expectation

Where to read

  1. Start here: Graph Theory and Additive Combinatorics: Exploring Structure and Randomness (author manuscript)

    Yufei Zhao · Book · English · Free full text

    §1.9 Randomized Constructions, opening definition of G(n,p) and Theorem 1.9.1

    Source page · Checked 2026-10-16

Continue from here

Combinatorics & Graph Theory in the library · Preparation and skip guidance · Terminology and translation evidence

Suggest an edit · Report a correction

Original orientation: CC BY-SA 4.0. Linked texts retain their own licences.