Asymmetric Results About Graph Homomorphisms
Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently hi...