Talk:Discharging method (discrete mathematics)

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	B Class	Low Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Needs diagrams. Tompw (talk) 13:05, 4 January 2007 (UTC)

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)