The early evolution of the H-free process
The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at t...
| Hlavní autoři: | , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
2009
|