


















Abstract:We study properties of graphs (or rather graph sequences) saying that some restricted count of subgraphs is approximatively what is expected in a random graph. It has been shown by several authors that many such properties characterize quasi-random graphs, but there are also some exceptions. We continue here the line of investigation in Janson and Sós (2013), and introduce some new versions of these properties, in order to better understand why many of these properties are quasi-random, and to understand the structure of the exceptions that are not. A new feature in the proofs is a simple decomposition of the subspace of symmetric functions in $L^2([0,1]^m)$ into subspaces that are irreducible for the action of measure-preserving transformations of $[0,1]$; this simplifies some arguments and gives structure to others.
From: Svante Janson [view email]
[v1]
Thu, 18 Jun 2026 12:59:55 UTC (46 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。