Quasirandomness in hypergraphs
An n-vertex graph G of edge density p is considered to be quasirandom if it shares several important properties with the random graph Gpn, pq. A well-known theorem of Chung, Graham and Wilson states that many such ‘typical’ properties are asymptotically equivalent and, thus, a graph G possessing one...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Published: |
Electronic Journal of Combinatorics
2018
|