Combinatorics Extremal combinatorics Concept
Graphon
Summary
A graphon is a symmetric measurable function . Graphons are the limit objects of sequences of dense graphs. A sequence converges when the density of each fixed small graph in it converges, and then the limit is a graphon. They also give the most general exchangeable model of a random graph. Graphons turn questions of extremal graph theory, such as Sidorenko's conjecture, into questions of analysis.
Further reading
About this page
| Tag | QMJ5PNSF9X |
|---|---|
| URI | m2://QMJ5PNSF9X |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C80, 05C63 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.