Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics
From Wikipedia, the free encyclopedia
Use {{maths rating|field=discrete|importance=XXX|class=YYY|comment= ~~~~}}
| Article | Need | Quality | Comments | Updated | ? |
|---|---|---|---|---|---|
| Discrete mathematics | Top | Start | Needs better overview of major areas, plus history/motivation | Tompw | Y |
| Graph theory | Top | B | Detail on "Data structures" section doesn't really belong in article; "Problems in graph theory" needs more prose to accompany list items. Also needs more diagrams | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Combinatorics | High | ||||
| Cryptography | High | ||||
| Edge coloring | High | Start | Needs less technical introduction; plus material on motivation and applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Hypergraph | High | Start | Needs material on history, motivation, applications, current state of research, and relations with graphs and graph theory. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Algebraic graph theory | High | Start | Little more than a stub - needs material on history, motivation, applications, major theorems, major contributors, current state of research. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Graph coloring | High | B | references, plus more on history / applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Petersen graph | High | B | Lists need more prose to accompany them. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Pigeonhole principle | High | B | Introduction needs a gentler introduction before formal statement. Section on infinite sets neds expansion. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Ramsey's theorem | High | B+ | Consider nominating for Good Article status | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Graph (mathematics) | High | B | Needs more on motivation and applications | Tompw (talk) 17:20, 3 January 2007 (UTC) | Y |
| Game theory | High |  FA |
. | Tompw 14:51, 20 November 2006 (UTC) | Y |
| Theory of computation | Mid | ||||
| Information theory | Mid | ||||
| Null graph | Mid | Stub | . | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Minor (graph theory) | Mid | Start | A diagram showing the process of edge conraction that leads from eth first graph to the second would be useful. General expansion needed, especially applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Triangle-free graph | Mid | Start | Needs diagrams, history, motivation, applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Turán's theorem | Mid | Start | Needs diagram of Turán graph, plus material on motivation and applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Complete graph | Mid | B | Needs references and applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Five color theorem | Mid | B | Really needs diagrams; needs a less technical overview | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Matching | Mid | B | Needs material on motivation and applications; really needs diagrams; a lot of the prose feels like a list without the bullet points | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Robertson–Seymour theorem | Mid | B | Intro really needs to be less technical. Needs material on motivation and applications | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Turán graph | Mid | B | Some explanation of technical terms (e.g. cograph) needed. Potential Good Artocle material. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Erdős–Szekeres theorem | Mid | B+ | May need more reference. Also consider nominatin for Good Article status | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Discrete geometry | Low | ||||
| Theoretical computer science | Low | ||||
| Computability theory | Low | ||||
| Complexity theory | Low | ||||
| Discharging Method (discrete mathematics) | Low | B | Needs diagrams | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Grötzsch graph | Low | B | Generally sound. Prose needs some copyediting to improve readability, references need formatting using <ref> tags. Then consider nominating for Good Article status. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Heawood graph | Low | B | would benefit from more explantion to accompany technical language. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Szekeres snark | Low | B | Barely more than a stub. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Happy Ending problem | Low | B+ | Format references using <ref> tags, then consider nominating for Good Article status | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Helly family | Low | Start | Needs more on motivation and applications. Real line example would benefit from diagram | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
| Tutte–Coxeter graph | Low | Start | References need to be formatted using <ref> tags; needs material on motivation and applications. | Tompw (talk) 16:14, 4 January 2007 (UTC) | Y |
Intial pass at importance rating. Feel free to change if you evaulate the article. Tompw 13:30, 7 October 2006 (UTC)
|
Assessment pages: General • Basics • Analysis • Algebra • Applied • Discrete • Foundations and set theory |
||
|
Other: Mathematics articles by quality (statistics - log - category - articles by importance) |
||
