Asymmetric results about graph homomorphisms
Lior Gishboliner, Eoin Hurley, and Yuval Wigderson

TL;DR
This paper explores asymmetric graph homomorphism results, establishing new bounds and conditions under which graphs with certain properties can be homomorphically mapped to smaller, triangle-free graphs, with implications for extremal graph theory.
Contribution
It introduces asymmetric versions of homomorphism theorems, providing improved bounds and conditions involving odd girth, VC dimension, and domination number, with novel proof techniques.
Findings
Graphs with high minimum degree and odd girth at least 9 are homomorphic to smaller triangle-free graphs.
Bounds on homomorphism thresholds exhibit a double phase transition from super-exponential to linear.
Weaker odd girth assumptions are sufficient when graphs have bounded VC dimension or domination number.
Abstract
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph has certain properties, then it has a homomorphism to a triangle-free graph of bounded size". For example, bounds on homomorphism thresholds give such a statement if has sufficiently high minimum degree, and the approximate homomorphism theorem gives such a statement for all , if one weakens the notion of homomorphism appropriately. In this paper, we study asymmetric versions of these results, where the assumptions on and need not match. For example, we prove that if is a graph with odd girth at least and minimum degree at least , then is homomorphic to a triangle-free graph whose size depends only on . Moreover, the odd girth assumption can be weakened to odd girth at least if has bounded VC dimension or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Advanced Topology and Set Theory
