= Claude Berge
{c}
{wiki}
<Claude Berge> was a <mathematician> whose work helped establish modern <graph theory>, with connections to <combinatorics>, <game theory> and <optimization>. His books gave common mathematical language to networks arising in different applications. He also formulated the strong perfect graph conjecture, a major stimulus to research on <perfect graphs>.https://mathshistory.st-andrews.ac.uk/Biographies/Berge/[Biography, books and strong perfect graph conjecture]{ref} A <perfect graph> has equal <chromatic number> and <clique number> in every <induced subgraph>. The condition expresses when the obvious lower bound for <graph coloring>, supplied by mutually adjacent vertices, is always attainable; requiring it in every <induced subgraph> is essential.
\Image[https://commons.wikimedia.org/wiki/Special:Redirect/file/Katona%20O.H.%20Gy.%20and%20Berge%20C.%201985.jpg?width=250]
{title=Portrait of <Claude Berge>}
{description=Mihály Hujter (HUJTER Mihály), photograph in New York, 1985; Commons records VRT permission ticket 2025052210006236. https://creativecommons.org/licenses/by-sa/4.0/[Creative Commons Attribution-Share Alike 4.0 International.], via Wikimedia Commons.}
{source=https://commons.wikimedia.org/wiki/File:Katona_O.H._Gy._and_Berge_C._1985.jpg}
{width=250}
Back to article page
