Ask a Question

Prefer a chat interface with context about you and your work?

FORCING QUASIRANDOMNESS WITH TRIANGLES

FORCING QUASIRANDOMNESS WITH TRIANGLES

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$. …