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 Grendelkhan (talk | contribs) at 17:02, 3 January 2007 (+{{maths rating}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Unassessed
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's priority scale.

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=98206117"