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

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 mid 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 = Mid
  |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
	Antimatroid (talk)	A-BB+	Comments (add/edit)
	Combinatorial game theory (talk)	A-BB+	Comments (add/edit)
	Best response (talk)	B	Comments (add/edit)
	Binary tree (talk)	B	Comments (add/edit)
	Catalan number (talk)	B	Comments (add/edit)
	Chaitin's constant (talk)	B	Comments (add/edit)
	Cheeger constant (graph theory) (talk)	B	Comments (add/edit)
	Complete graph (talk)	B	Comments (add/edit)
	Dilworth's theorem (talk)	B	Comments (add/edit)
	Five color theorem (talk)	B	Comments (add/edit)
	Hadwiger–Nelson problem (talk)	B	Comments (add/edit)
	Matching (talk)	B	Comments (add/edit)
	Petersen graph (talk)	B	Comments (add/edit)
	Planar graph (talk)	B	Comments (add/edit)
	Robertson–Seymour theorem (talk)	B	Comments (add/edit)
	Travelling salesman problem (talk)	B	Comments (add/edit)
	Turán graph (talk)	B	Comments (add/edit)
	Algebraic graph theory (talk)	Start	Comments (add/edit)
	Barycentric subdivision (talk)	Start	Comments (add/edit)
	Bell number (talk)	Start	Comments (add/edit)
	Bell polynomials (talk)	Start	Comments (add/edit)
	Binary Golay code (talk)	Start	Comments (add/edit)
	Bipartite graph (talk)	Start	Comments (add/edit)
	Coding theory (talk)	Start	Comments (add/edit)
	Cograph (talk)	Start	Comments (add/edit)
	Complete bipartite graph (talk)	Start	Comments (add/edit)
	Complete coloring (talk)	Start	Comments (add/edit)
	Connectivity (graph theory) (talk)	Start	Comments (add/edit)
	Crossing number (talk)	Start	Comments (add/edit)
	Decision problem (talk)	Start	Comments (add/edit)
	Decision theory (talk)	Start	Comments (add/edit)
	Difference operator (talk)	Start	Comments (add/edit)
	Dobinski's formula (talk)	Start	Comments (add/edit)
	Domino tiling (talk)	Start	Comments (add/edit)
	Dual graph (talk)	Start	Comments (add/edit)
	Elliptic curve cryptography (talk)	Start	Comments (add/edit)
	Eulerian path (talk)	Start	Comments (add/edit)
	Hamiltonian path (talk)	Start	Comments (add/edit)
	Heawood conjecture (talk)	Start	Comments (add/edit)
	Helly's theorem (talk)	Start	Comments (add/edit)
	Icosahedral symmetry (talk)	Start	Comments (add/edit)
	Knapsack problem (talk)	Start	Comments (add/edit)
	König's lemma (talk)	Start	Comments (add/edit)
	König's theorem (graph theory) (talk)	Start	Comments (add/edit)
	Marriage theorem (talk)	Start	Comments (add/edit)
	Motzkin number (talk)	Start	Comments (add/edit)
	Robinson-Schensted algorithm (talk)	Start	Comments (add/edit)
	Run-time analysis (talk)	Start	Comments (add/edit)
	Shift space (talk)	Start	Comments (add/edit)
	Spanning tree (mathematics) (talk)	Start	Comments (add/edit)
	Szemerédi's theorem (talk)	Start	Comments (add/edit)
	Triangle-free graph (talk)	Start	Comments (add/edit)
	Turán's theorem (talk)	Start	Comments (add/edit)
	Tutte–Coxeter graph (talk)	Start	Comments (add/edit)
	Van der Waerden's theorem (talk)	Start	Comments (add/edit)
	Asymptotic computational complexity (talk)	Stub	Comments (add/edit)
	Biconnected graph (talk)	Stub	Comments (add/edit)
	Branch (graph theory) (talk)	Stub	Comments (add/edit)
	Clique (graph theory) (talk)	Stub	Comments (add/edit)
	Distance (graph theory) (talk)	Stub	Comments (add/edit)
	Double counting (proof technique) (talk)	Stub	Comments (add/edit)
	Edge contraction (talk)	Stub	Comments (add/edit)
	Erdős–Rényi model (talk)	Stub	Comments (add/edit)
	Forbidden graph characterization (talk)	Stub	Comments (add/edit)
	Graph invariant (talk)	Stub	Comments (add/edit)
	Graph property (talk)	Stub	Comments (add/edit)
	Hereditary property (talk)	Stub	Comments (add/edit)
	Menger's theorem (talk)	Stub	Comments (add/edit)
	Null graph (talk)	Stub	Comments (add/edit)
	Subtree graph (talk)	Stub	Comments (add/edit)
	Tournament (graph theory) (talk)	Stub	Comments (add/edit)
	Tutte theorem (talk)	Stub	Comments (add/edit)
	Hadwiger conjecture (graph theory) (talk)	UNone	Comments (add/edit)