Grid-norm Regularity for Somewhat Dense Graphs and Applications

Explore a computer science seminar that delves into groundbreaking research on grid-norm regularity in graph theory and its diverse applications. Learn about the significant advancement made by Raghu Meka and Zander Kelley in 2023 regarding the bounds of arithmetic progressions in integer sets, and discover how their findings evolved into widely applicable graph-theoretic tools. Examine the concept of grid-norm and its role in measuring bipartite graph pseudorandomness, while understanding its implications in communication complexity and graph algorithms. Gain insights into collaborative research findings that bridge theoretical computer science with practical applications, presented through the lens of discrete mathematics and graph theory.