Cayley graphs, constructed from the algebraic structure of groups, provide a natural framework for exploring complex combinatorial properties. In these graphs, vertices represent group elements and ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Among the 23 remarkable individuals who won MacArthur Foundation fellowships earlier this week, there was mathematician Maria Chudnovsky, who is married to a violist, and stringed instrument bow-maker ...

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. Luckily, ...

Imagine you are planning a banquet. You want to make sure that if two people don't like each other, they don't sit at the same table. To help with planning, you might draw a diagram with dots for ...

Perold, André, V. Chvatal, R. L. Graham, and S. Whitesides. "Combinatorial Designs Related to the Strong Perfect Graph Conjecture." Discrete Mathematics 26, no. 2 ...

The study of the possible valences for edge-magic labelings of graphs has motivated us to introduce the concept of perfect edge-magic graphs. Intuitively speaking, an edge-magic graph is perfect ...