Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics/High

From Wikipedia, the free encyclopedia

v • d • e WikiProject Mathematics : Wikipedia 1.0 Assessment (Talk) Project information: Assessment scheme (quality, importance, field) • Summary tables • Maths rating template • Project structure • WP 1.0 Mathematics articles (statistics, log) Assessment by subject: General • Basics • Algebra • Analysis • Applied • Discrete • Frequently viewed • Foundations, logic, and set theory • Geometry • Mathematical physics • Number theory • Probability and statistics • Topology • Theorems and conjectures • History • Mathematicians • Vital articles Assessment by quality: FA • A • GA • B+ • B • Start • Stub • Unassessed Categories: Articles by quality (FA, A, GA, B+, B, Start, Stub, Unassessed) • Articles by importance (Top, High, Mid, Low, Unassessed) • Historical articles • Vital articles • Unassessed field • Incomplete assessments • Assessments without comments

This page lists high priority articles that have been assigned to the field Discrete mathematics using the {{maths rating}} template. To include articles on this page, use the following wiki code (in which newlines are optional).

{{maths rating
  |class = quality grading (FA, A, GA, Bplus, B, Start, or Stub)
  |importance = High
  |field = Discrete mathematics
}}

[edit] Description

This field is for articles concerning the more combinatorial, computational, finite, or constructive aspects of mathematics, including:

combinatorics, algorithms and theoretical computer science.

Some articles in these areas might instead be rated under algebra or applied, depending on their content.

For a list of, or links to, all articles in this field, see Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics.

The articles are listed in a table below, which is updated automatically by VeblenBot.

	Article	Grade	Comments
	Graph (mathematics) (talk)	A-BB+	Comments (add/edit)
	Halting problem (talk)	A-BB+	Comments (add/edit)
	P = NP problem (talk)	A-BB+	Comments (add/edit)
	Ramsey's theorem (talk)	A-BB+	Comments (add/edit)
	Computational complexity theory (talk)	B	Comments (add/edit)
	Discrete Fourier transform (talk)	B	Comments (add/edit)
	Graph coloring (talk)	B	Comments (add/edit)
	NP-complete (talk)	B	Comments (add/edit)
	Nash equilibrium (talk)	B	Comments (add/edit)
	Pigeonhole principle (talk)	B	Comments (add/edit)
	Edge coloring (talk)	Start	Comments (add/edit)
	Extremal graph theory (talk)	Start	Comments (add/edit)
	Generating function (talk)	Start	Comments (add/edit)
	Hypergraph (talk)	Start	Comments (add/edit)
	Minor (graph theory) (talk)	Start	Comments (add/edit)
	Random graph (talk)	Start	Comments (add/edit)
	Tree (graph theory) (talk)	Start	Comments (add/edit)
	Young tableau (talk)	Start	Comments (add/edit)
	Combinatorial design (talk)	Stub	Comments (add/edit)
	Polynomial time (talk)	Stub	Comments (add/edit)
	Szemerédi regularity lemma (talk)	Stub	Comments (add/edit)