Finitely forcible graphons with an almost arbitrary structure
A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if $G$ is a graph with $n$ vertices and density $p$, and if the number of 4-cycles in $G$ is approximately $p^4\binom n4$, then $G$ resembles a random graph of the same density. In particular, between any two sets...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
|
| Series: | Discrete Analysis |
| Online Access: | http://discrete-analysis.scholasticahq.com/article/12058-finitely-forcible-graphons-with-an-almost-arbitrary-structure.pdf |