Discrete Applied Mathematics Seminar by Abhishek Dhawan: Balanced Independent Sets and Colorings

Speaker: Abhishek Dhawan, postdoctoral research associate, University of Illinois Urbana-Champaign

Title: Balanced Independent Sets and Colorings

 

Abstract: An independent set in a bipartite graph G = (X, Y, E) is balanced if it contains an equal number of vertices from each partition. A balanced coloring of G is a proper coloring of G such that each color class forms a balanced independent set. In this talk, we will discuss recent results in the area with a particular focus on the extension to multipartite hypergraphs. This talk is partially based on joint work with Yuzhou Wang.

 

Discrete Applied Math Seminar

Request link