Many years later, as a graduate student at Princeton University, she helped solve a long-standing question in a mathematical field called graph theory ... graphs, called Berge graphs and perfect ...

Perfect graphs are, by definition, colorable with the most limited palette possible. When coloring a graph, every node in a mutually connected cluster, or “clique,” must receive a distinct color, so ...

Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables.

It also has direct and crucial implications for a branch of mathematics known as graph theory. These graphs consist of collections of points, or vertices, that may (or may not) be connected to each ...

KALAMAZOO, Mich.—Western Michigan University's international reputation on the topic of graph theory is on display in a new book published recently by Princeton University Press. Graph theory, a ...

However, generalizing from graphs to hypergraphs quickly gets complicated. One way to illustrate this is to consider the canonical cut problem from graph theory, which asks: Given two distinct nod ...