Jump to content

Talk:Discharging method (discrete mathematics)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ptrillian (talk | contribs) at 06:50, 2 January 2007 (←Created page with 'Todo: add a list of other "significant" results proved by discharging. These could include: Borodin's proof that every planar graph with minimum degree 5 contains a...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Todo: add a list of other "significant" results proved by discharging. These could include: Borodin's proof that every planar graph with minimum degree 5 contains a triangle with degree sum at most 17 and Borodin's proof that every planar graph with maximum degree at least 12 has edge-list chromatic number equal to maximum degree. Ptrillian 06:50, 2 January 2007 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Discharging_method_(discrete_mathematics)&oldid=97895019"