Graph Limits and Homomorphism Density Inequalities
Offered By: BIMSA via YouTube
Course Description
Overview
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.
Syllabus
Fan Wei: Graph limits and homomorphism density inequalities #ICBS2024
Taught by
BIMSA
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer