Please join the Department of Applied Mathematics on Monday, April 28, 2025, at 1:50–2:50 p.m. in the John T. Rettaliata Engineering Center, room 104, for a seminar. Speaker Noga Alon, professor of mathematics at Princeton University, will give a talk titled “Graph-Codes and Connectivity.”

Abstract

Viewing binary vectors as characteristic vectors of sets of edges of graphs transforms the basic combinatorial questions of Coding Theory into intriguing extremal problems about families of graphs. I will discuss these questions and describe several results and open problems. In particular I will study d-regular graphs G that contain a family of 2^d subgraphs so that for any two of them the graph consisting of all edges that belong to exactly one of the two is a spanning connected subgraph of G.