Explore the fascinating world of graph theory in this 38-minute lecture by Maria Chudnovsky from Princeton University. Delve into the concept of forbidding induced subgraphs and discover their impact on graph structure and algorithms. Learn about cutting-edge research in this field and gain insights into potential applications in computer science and mathematics. Attend this thought-provoking talk at the Fields Institute on Friday, August 16th, 2024, as part of the FFFM-2024 event series.
Forbidding Induced Subgraphs - Structure and Algorithms
Overview
Syllabus
Forbidding induced subgraphs: structure and algorithms
Taught by
Fields Institute
Related Courses
-
Induced Subgraphs and Tree Decompositions
-
Counting Small Induced Subgraphs Satisfying Monotone Properties
-
On the Instance Optimality of Detecting Collisions and Subgraphs
-
Communication and Information Complexity
-
Algorithms Approaching the Threshold for Semirandom Planted Clique
-
Linear and Sublinear Algorithms for Graphlet Sampling
