Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics

From Wikipedia, the free encyclopedia



This page lists 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 = priority level (Top, High, Mid, or Low)
  |field = Discrete mathematics
}}

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.

Discrete mathematics article ratings
Priority Quality
Featured article FA A Good article GA A-BB+ B Start Stub UA Total
Top 0 0 0 0 0 2 1 0 3
High 0 0 0 4 6 8 3 0 21
Mid 0 0 0 2 15 38 17 1 73
Low 0 0 1 0 7 39 45 0 92
UA 0 0 0 0 0 0 0 0 0
Total 0 0 1 6 28 87 66 1 189
Last updated: Wed Jun 11 01:10:17 UTC 2008

The articles in this field are sorted by importance (or priority) and listed in the tables below. These tables are updated automatically by VeblenBot.

Discrete mathematics articles by priority
Top-Priority High-Priority Mid-Priority Low-Priority Unassessed priority

Top-Priority

Article Grade Comments
  Combinatorics (talk) Start
  Graph theory (talk) Start
  Discrete mathematics (talk) Stub
Last updated: Wed Jun 11 01:10:17 UTC 2008

High-Priority

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

Mid-Priority

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

Low-Priority

Article Grade Comments
  Pseudoforest (talk) A-Good article GA
  Discharging method (discrete mathematics) (talk) B
  Erdős–Szekeres theorem (talk) B
  Fair division (talk) B
  Grötzsch graph (talk) B
  Happy Ending problem (talk) B
  Heawood graph (talk) B
  Polyomino (talk) B
  Alabama paradox (talk) Start
  Aperiodic graph (talk) Start
  Assignment problem (talk) Start
  Cartesian product of graphs (talk) Start
  Catalan's constant (talk) Start
  Cayley's formula (talk) Start
  Collaboration graph (talk) Start
  Combinatorial proof (talk) Start
  Cube-connected cycles (talk) Start
  Cycle index (talk) Start
  Cycles and fixed points (talk) Start
  DFT matrix (talk) Start
  De Bruijn graph (talk) Start
  De Bruijn sequence (talk) Start
  Delannoy number (talk) Start
  Delaunay triangulation (talk) Start
  Difference set (talk) Start
  Distance-regular graph (talk) Start
  Dowling geometry (talk) Start
  Edge-graceful labeling (talk) Start
  Helly family (talk) Start
  Hexomino (talk) Start
  Kirkman's schoolgirl problem (talk) Start
  Klee's measure problem (talk) Start
  Kneser graph (talk) Start
  Knight's tour (talk) Start
  Kruskal's algorithm (talk) Start
  Mathematics of Sudoku (talk) Start
  Multiple edges (talk) Start
  Möbius–Kantor graph (talk) Start
  Narayana number (talk) Start
  Network topology (talk) Start
  Pentomino (talk) Start
  Polyform (talk) Start
  Polyiamond (talk) Start
  Problems in Latin squares (talk) Start
  Random regular graph (talk) Start
  Schröder number (talk) Start
  Thue-Morse sequence (talk) Start
  Automatic group (talk) Stub
  Biadjacency matrix (talk) Stub
  Bidirected graph (talk) Stub
  Book (graph theory) (talk) Stub
  Bridge (graph theory) (talk) Stub
  Bridge number (talk) Stub
  Cactus graph (talk) Stub
  Combinatorial class (talk) Stub
  Combinatorial enumeration (talk) Stub
  Combinatorial explosion (talk) Stub
  Connected component (graph theory) (talk) Stub
  Covering (graph theory) (talk) Stub
  Critical graph (talk) Stub
  Cubic graph (talk) Stub
  Cycle graph (talk) Stub
  Cycle space (talk) Stub
  Cyclically reduced word (talk) Stub
  Davis–Putnam algorithm (talk) Stub
  Degree (graph theory) (talk) Stub
  Degree distribution (talk) Stub
  Dense graph (talk) Stub
  Dickson's lemma (talk) Stub
  Disperser (talk) Stub
  Distance-transitive graph (talk) Stub
  Domatic number (talk) Stub
  Domino problem (talk) Stub
  Dual code (talk) Stub
  Erdős–Stone theorem (talk) Stub
  Factorion (talk) Stub
  Information set (game theory) (talk) Stub
  K-core (talk) Stub
  Kautz graph (talk) Stub
  Kendall tau distance (talk) Stub
  Kirchhoff's theorem (talk) Stub
  List coloring (talk) Stub
  Polyabolo (talk) Stub
  Polycube (talk) Stub
  Polydrafter (talk) Stub
  Polyhex (mathematics) (talk) Stub
  Road coloring problem (talk) Stub
  Rook's graph (talk) Stub
  Strongly connected component (talk) Stub
  Szekeres snark (talk) Stub
  Tait's conjecture (talk) Stub
  Tromino (talk) Stub
Last updated: Wed Jun 11 01:10:17 UTC 2008

Unassessed priority

There are currently no unassessed-priority Discrete mathematics articles.

Last updated: Wed Jun 11 01:10:17 UTC 2008