| Summary: | We study forcing pairs for quasirandom graphs. Chung, Graham, and Wilson initiated the study of families ${\mathcal{F}}$ of graphs with the property that if a large graph $G$ has approximately homomorphism density $p^{e(F)}$ for some fixed $p\in (0,1]$ for every $F\in {\mathcal{F}}$, then $G$ is quasirandom with density $p$. Such families ${\mathcal{F}}$ are said to be forcing. Several forcing families were found over the last three decades and characterizing all bipartite graphs $F$ such that $(K_{2},F)$ is a forcing pair is a well-known open problem in the area of quasirandom graphs, which is closely related to Sidorenko’s conjecture. In fact, most of the known forcing families involve bipartite graphs only.
|
|---|