googleb1fd7cd7ef71feda.html

Πέμπτη 22 Οκτωβρίου 2015

Theorists Draw Closer to Perfect Coloring

When Princeton mathematician Maria Chudnovsky needed to harmoniously seat 120 guests at her wedding, she turned to her field of expertise: graph theory, the study of objects linked together in networks. Chudnovsky and her collaborators have recently derived a result that pertains to her wedding problem: identifying so-called perfect graphs.
A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.
QUANTAMAGAZINE.ORG

Δεν υπάρχουν σχόλια: