Explore the powerful theory of graph limits and its applications in studying graphs from a continuous perspective in this hour-long conference talk. Delve into the undecidability of proving general inequalities of homomorphism densities into arbitrarily edge-weighted graphs. Discover how the graph limits perspective aids in studying graph homomorphism inequalities and advancing extremal combinatorics. Investigate the question of when randomness provides nearly optimal bounds in this field. Gain insights into the intersection of graph theory, continuous mathematics, and computational complexity through this in-depth presentation by Fan Wei at the ICBS2024 conference.
Overview
Syllabus
Fan Wei: Graph limits and homomorphism density inequalities #ICBS2024
Taught by
BIMSA