Jump to content

Wikipedia:WikiProject Mathematics/PlanetMath Exchange/05-XX Combinatorics

Add links
From Wikipedia, the free encyclopedia

This page provides a list of all articles available at PlanetMath in the following topic:

05-XX Combinatorics.

This list will be periodically updated. Each entry in the list has three fields:

  1. PM : The first field is the link to the PlanetMath article, along with the article's object ID.
  2. WP : The second field is either a "guessed" link to a correspondingly named Wikipedia article, produced by the script which generated the list, or one or more manually entered links to the corresponding Wikipedia articles on the subject.
  3. Status : The third field is the status field, which explains the current status of the entry. The recommended status entries are:
Status means PM article
N not needed
A adequately covered
C copied
M merged
NC needs copying
NM needs merging
  • Please update the WP and Status fields as appropriate.
  • if the WP field is correct please remove the qualifier "guess".
  • If the corresponding Wikipedia article exists, but the link to it is wrong, please fix the link.
  • If you copy or merge an article from PlanetMath, please update the WP and Status fields for that entry.
  • If you have any comments, for example, thoughts on how the PlanetMath article compares to the corresponding Wikipedia article(s), please place such comments on a new indented line following the entry. Comments of this kind are very valuable.

Don't forget to include the relevant template if you copy over text or feel like an external link is warranted

  • {{planetmath|id=|title=}} for copied over text
  • {{planetmath reference|id=|title=}} for an external link

See the main page for examples and usage criteria.

One can use the web-based program Pmform to convert PlanetMath articles to the Wikipedia format. As a side benefit, this tool will place the PlanetMath template for you.

05-00 General reference works (handbooks, dictionaries, bibliographies, etc.) (complete)

[edit]
All articles processed. Paul August ☎ 02:25, 1 June 2006 (UTC)[reply]
Paul August ☎ 21:51, August 22, 2005 (UTC)
Rich Farmbrough 16:54, 26 August 2005 (UTC)[reply]
linas 15:48, 7 August 2005 (UTC)[reply]

05A05 Combinatorial choice problems (subsets, representatives, permutations) (complete)

[edit]
All articles processed. Paul August ☎ 02:26, 1 June 2006 (UTC)[reply]
Rich Farmbrough 22:08, 26 August 2005 (UTC)[reply]
Rich Farmbrough 19:14, 26 August 2005 (UTC)[reply]

05A10 Factorials, binomial coefficients, combinatorial functions (complete)

[edit]
All articles processed. Paul August ☎ 22:31, 29 August 2006 (UTC)[reply]
Mikkalai 04:49, 4 Feb 2005 (UTC)
Catalan numbers redirects to Catalan number Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
Copied by User:Drini on 28 June 2005 linas 04:04, 22 August 2005 (UTC)[reply]
double factorial redirects to Factorial, while PM aricle is empty. Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
Rich Farmbrough 21:44, 26 August 2005 (UTC)[reply]
generalized binomial coefficient redirect to binomial coefficient. Mikkalai 04:49, 4 Feb 2005 (UTC)
Merged, but some had already been merged. Rich Farmbrough 21:53, 26 August 2005 (UTC)[reply]
Ruiz identities seem to be vanity names, and PM author has consistently failed to provide references to literature where such term is used other than Ruiz own papers. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
I dunno, looks generally useful, seems to show up on Mathworld Binomial sums, although the name may be a neologism. linas 15:56, 7 August 2005 (UTC)[reply]
Rich Farmbrough 22:57, 28 August 2005 (UTC)[reply]
PM has some examples that should be copied over. linas 04:09, 22 August 2005 (UTC)[reply]
Rich Farmbrough 22:03, 26 August 2005 (UTC)[reply]
Proof must be merged into WP, see below. Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
This was merged by Rich Farmbrough August 23, 2005. Paul August ☎ 21:22, 22 June 2006 (UTC)[reply]
Rich Farmbrough 19:20, 29 August 2005 (UTC)[reply]
Rich Farmbrough 19:20, 29 August 2005 (UTC)[reply]
Mikkalai 04:49, 4 Feb 2005 (UTC)
Since the parent entry is not needed. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
Merged into binomial coefficient Pedro Sanchez 22:22, 17 May 2005 (UTC)[reply]
Besides being a minor identity, Ruiz identities seem to be vanity names, and PM author has consistently failed to provide references to literature where such term is used other than Ruiz own papers. Moreover, this entry is no longer named Ruiz identity in PM. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
binomial coefficient contains the info. Redirect from long title is unnecessary. Mikkalai 04:49, 4 Feb 2005 (UTC)
The PM article is a proof of an identity; WP currently doesn't have (many) proofs; it would need to be copied. linas 16:43, 7 August 2005 (UTC)[reply]
Merged into binomial coefficient Pedro Sanchez 22:22, 17 May 2005 (UTC)[reply]
Paul August ☎ 02:18, 1 June 2006 (UTC)[reply]

05A15 Exact enumeration problems, generating functions

[edit]
NM: 1. Paul August ☎ 20:21, 5 June 2006 (UTC)[reply]
NC: 1. Paul August ☎ 22:29, 22 June 2006 (UTC)[reply]
PM article much more complete drini ☎ 04:05, 18 May 2005 (UTC)[reply]
Rich Farmbrough 14:54, 2 September 2005 (UTC)[reply]
PM article much more complete drini ☎ 04:05, 18 May 2005 (UTC)[reply]
Oleg Alexandrov 21:56, 29 August 2005 (UTC)[reply]
Paul August ☎ 22:29, 22 June 2006 (UTC)[reply]
I don't think we necessarily need this but if so then it sohould probably be merged with Stirling polynomial (see below). Paul August ☎ 20:21, 5 June 2006 (UTC)[reply]
Currently Stirling polynomial redirects to difference polynomials, but I think it could have its own article. Paul August ☎ 20:21, 5 June 2006 (UTC)[reply]

05A16 Asymptotic enumeration

[edit]

05A17 Partitions of integers (complete)

[edit]
All articles processed. Paul August ☎ 20:25, 5 June 2006 (UTC)[reply]
linas 16:18, 7 August 2005 (UTC)[reply]
Paul August ☎ 20:25, 5 June 2006 (UTC)[reply]

05A18 Partitions of sets (complete)

[edit]
All articles processed. Paul August ☎ 20:26, 5 June 2006 (UTC)[reply]
PM article does contain a short proof that WP does not. linas 15:59, 7 August 2005 (UTC)[reply]

05A19 Combinatorial identities (complete)

[edit]
All articles processed. Paul August ☎ 20:48, 5 June 2006 (UTC)[reply]
It was merged by User:Drini on 28 June 2005. linas 16:03, 7 August 2005 (UTC)[reply]
linas 16:06, 7 August 2005 (UTC)[reply]
Paul August ☎ 20:48, 5 June 2006 (UTC)[reply]
[edit]

05A99 Miscellaneous (complete)

[edit]
All article processed. Paul August ☎ 20:49, 5 June 2006 (UTC)[reply]
Rich Farmbrough 19:27, 26 August 2005 (UTC)[reply]
Not needed, as we mostly don't do proofs on WP. linas 04:14, 22 August 2005 (UTC)[reply]

05Axx Enumerative combinatorics

[edit]

05B05 Block designs

[edit]
NM: 1. Paul August ☎ 21:34, 5 June 2006 (UTC)[reply]
This content is spread among several WP articles. Paul August ☎ 21:34, 5 June 2006 (UTC)[reply]

05B07 Triple systems

[edit]

05B10 Difference sets (number-theoretic, group-theoretic, etc.)

[edit]

05B15 Orthogonal arrays, Latin squares, Room squares (complete)

[edit]
All article processed. Paul August ☎ 21:35, 5 June 2006 (UTC)[reply]
linas 16:31, 7 August 2005 (UTC)[reply]
linas 16:31, 7 August 2005 (UTC)[reply]
linas 16:24, 7 August 2005 (UTC)[reply]
linas 16:31, 7 August 2005 (UTC)[reply]

05B20 Matrices (incidence, Hadamard, etc.)

[edit]

05B25 Finite geometries

[edit]
NM: 2. Paul August ☎ 22:04, 5 June 2006 (UTC)[reply]
NC: 3.Paul August ☎ 04:19, 16 June 2006 (UTC)[reply]
This article, together with the PM article linear space and near-linear space below, need to be copied to something like linear space (geometry). Paul August ☎ 04:19, 16 June 2006 (UTC)[reply]
Created redirect to already existing entry. -- < drini | ∂drini > 16:24, 23 August 2005 (UTC)[reply]
Paul August ☎ 22:00, 5 June 2006 (UTC)[reply]
Could have its own article. Paul August ☎ 21:56, 5 June 2006 (UTC)[reply]
A proof we don't particularly need. Paul August ☎ 04:25, 16 June 2006 (UTC)[reply]
Paul August ☎ 21:48, 5 June 2006 (UTC)[reply]
Paul August ☎ 03:39, 16 June 2006 (UTC)[reply]

05B35 Matroids, geometric lattices

[edit]
NM: 4. Paul August ☎ 22:44, 5 June 2006 (UTC)[reply]
linas 16:50, 7 August 2005 (UTC)[reply]
Rich Farmbrough 21:20, 22 August 2005 (UTC)[reply]
linas 16:50, 7 August 2005 (UTC)[reply]
Paul August ☎ 22:34, 5 June 2006 (UTC)[reply]
Rich Farmbrough 14:58, 29 August 2005 (UTC)[reply]
Paul August ☎ 22:39, 5 June 2006 (UTC)[reply]

05B50 Polyominoes (complete)

[edit]
All articles processed. Paul August ☎
Paul August ☎ 22:55, 5 June 2006 (UTC)[reply]

05B99 Miscellaneous (complete)

[edit]
All articles processed: Paul August ☎ 22:56, 5 June 2006 (UTC)[reply]
Mikkalai 04:52, 4 Feb 2005 (UTC)
Mikkalai 04:52, 4 Feb 2005 (UTC)

05Bxx Designs and configurations

[edit]

05C05 Trees

[edit]
NM: 7. Paul August ☎ 05:39, 19 June 2006 (UTC)[reply]
NC: 3. Paul August ☎ 05:39, 19 June 2006 (UTC)[reply]
linas 04:23, 22 August 2005 (UTC)[reply]
linas 04:25, 22 August 2005 (UTC)[reply]
linas 04:27, 22 August 2005 (UTC)[reply]
Paul August ☎ 02:25, 17 June 2006 (UTC)[reply]
linas 04:29, 22 August 2005 (UTC)[reply]
Paul August ☎ 04:25, 22 June 2006 (UTC)[reply]
Paul August ☎ 04:25, 22 June 2006 (UTC)[reply]
Paul August ☎ 04:36, 16 June 2006 (UTC)[reply]
Should be merged into binary tree (could also have its own article) Paul August ☎ 05:24, 19 June 2006 (UTC)[reply]
Paul August ☎ 03:00, 17 June 2006 (UTC)[reply]
Paul August ☎ 04:59, 16 June 2006 (UTC)[reply]
linas 04:32, 22 August 2005 (UTC)[reply]
Should be copied along with PM article "Weighted path length" below. Paul August ☎ 05:39, 19 June 2006 (UTC)[reply]
Paul August ☎ 02:43, 6 June 2006 (UTC)[reply]
Paul August ☎ 03:22, 17 June 2006 (UTC)[reply]
Paul August ☎ 03:11, 17 June 2006 (UTC)[reply]
linas 04:34, 22 August 2005 (UTC)[reply]
linas 04:38, 22 August 2005 (UTC)[reply]
Paul August ☎ 16:42, 17 October 2006 (UTC)[reply]
  • PM: trie, id=2684 -- WP: trie -- Status: A
linas 04:40, 22 August 2005 (UTC)[reply]
Should be copied along with PM article "Weighted path length" below.
Paul August ☎ 05:39, 19 June 2006 (UTC)[reply]
Paul August ☎ 02:47, 10 June 2006 (UTC)[reply]

05C10 Topological graph theory, imbedding

[edit]
NM: 1. Paul August ☎ 03:10, 6 June 2006 (UTC)[reply]
Redirects to crossing number Terry 04:34, 15 Feb 2005 (UTC)
Paul August ☎ 03:10, 6 June 2006 (UTC)[reply]
Paul August ☎ 03:10, 6 June 2006 (UTC)[reply]
-- < drini | ∂drini > 16:33, 23 August 2005 (UTC)[reply]
Rich Farmbrough 19:43, 26 August 2005 (UTC)[reply]
Rich Farmbrough 12:05, 23 August 2005 (UTC)[reply]
linas 04:18, 22 August 2005 (UTC)[reply]
Rich Farmbrough 19:50, 26 August 2005 (UTC)[reply]
Redirects to crossing number Terry 04:34, 15 Feb 2005 (UTC)
Rich Farmbrough 19:36, 26 August 2005 (UTC)[reply]

05C12 Distance in graphs (complete)

[edit]
All articles processed. Paul August ☎ 04:43, 6 June 2006 (UTC)[reply]
linas 16:54, 7 August 2005 (UTC)[reply]
Paul August ☎ 04:32, 6 June 2006 (UTC)[reply]
Paul August ☎ 04:36, 6 June 2006 (UTC)[reply]
Paul August ☎ 04:43, 6 June 2006 (UTC)[reply]

05C15 Coloring of graphs and hypergraphs

[edit]
NM: 9. Paul August ☎ 15:17, 6 June 2006 (UTC)[reply]
Paul August ☎ 04:50, 6 June 2006 (UTC)[reply]
Paul August ☎ 04:52, 6 June 2006 (UTC)[reply]
Paul August ☎ 05:11, 6 June 2006 (UTC)[reply]
Paul August ☎ 13:43, 6 June 2006 (UTC)[reply]
Paul August ☎ 05:14, 6 June 2006 (UTC)[reply]
Paul August ☎ 05:21, 6 June 2006 (UTC)[reply]
Paul August ☎ 14:26, 6 June 2006 (UTC)[reply]
Paul August ☎ 14:26, 6 June 2006 (UTC)[reply]
Paul August ☎ 14:31, 6 June 2006 (UTC)[reply]
Paul August ☎ 14:36, 6 June 2006 (UTC)[reply]
This article gives a relation between the maximum independent set, chromatic number, and the size, of a graph. A mention of this could be made in both articles. Paul August ☎ 14:47, 6 June 2006 (UTC)[reply]
There is a lot of information here that probably could be merged into various articles. Paul August ☎ 14:51, 6 June 2006 (UTC)[reply]
Paul August ☎ 14:55, 6 June 2006 (UTC)[reply]
Not sure if we need this proof. Paul August ☎ 15:17, 6 June 2006 (UTC)[reply]
Paul August ☎ 15:17, 6 June 2006 (UTC)[reply]
Paul August ☎ 15:05, 6 June 2006 (UTC)[reply]

05C20 Directed graphs (digraphs), tournaments (complete)

[edit]
All articles processed. Paul August ☎ 16:03, 6 June 2006 (UTC)[reply]
Jtwdog 18:35, 28 October 2005 (UTC)[reply]
Rich Farmbrough 19:53, 26 August 2005 (UTC)[reply]
-it's a redirect to graph Rich Farmbrough 19:59, 26 August 2005 (UTC)[reply]
Rich Farmbrough 19:57, 26 August 2005 (UTC)[reply]
Paul August ☎ 16:03, 6 June 2006 (UTC)[reply]
Rich Farmbrough 20:00, 26 August 2005 (UTC)[reply]
Radagast3 (talk) 12:58, 27 March 2009 (UTC)[reply]

05C25 Graphs and groups

[edit]
NM: 1. Paul August ☎ 16:16, 6 June 2006 (UTC)[reply]
NC: 1. Paul August ☎ 16:16, 6 June 2006 (UTC)[reply]
The PM article contains symbolism that WP doesn't. linas 16:59, 7 August 2005 (UTC)[reply]
Paul August ☎ 16:16, 6 June 2006 (UTC)[reply]

05C30 Enumeration of graphs and maps (complete)

[edit]

05C38 Paths and cycles

[edit]
NM: 1. Paul August ☎ 19:18, 6 June 2006 (UTC)[reply]
drini ☎ 28 June 2005 16:44 (UTC)
Paul August ☎ 18:33, 6 June 2006 (UTC)[reply]
Paul August ☎ 18:12, 6 June 2006 (UTC)[reply]
Paul August ☎ 18:35, 6 June 2006 (UTC)[reply]
Paul August ☎ 18:41, 6 June 2006 (UTC)[reply]
I think Wikipedia covers it better. Cholerashot 21:20, 4 June 2006 (UTC)[reply]
Paul August ☎ 18:48, 6 June 2006 (UTC)[reply]
Paul August ☎ 19:18, 6 June 2006 (UTC)[reply]
Paul August ☎ 18:54, 6 June 2006 (UTC)[reply]
Paul August ☎ 19:18, 6 June 2006 (UTC)[reply]
Paul August ☎ 19:05, 6 June 2006 (UTC)[reply]

05C40 Connectivity

[edit]
NM: 4. Paul August ☎ 15:13, 7 June 2006 (UTC)[reply]
NC: 2. Paul August ☎ 15:13, 7 June 2006 (UTC)[reply]
Paul August ☎ 01:27, 7 June 2006 (UTC)[reply]
Paul August ☎ 01:27, 7 June 2006 (UTC)[reply]
Paul August ☎ 01:30, 7 June 2006 (UTC)[reply]
Paul August ☎ 14:59, 7 June 2006 (UTC)[reply]
Paul August ☎ 15:02, 7 June 2006 (UTC)[reply]
Paul August ☎ 15:06, 7 June 2006 (UTC)[reply]
Paul August ☎ 15:13, 7 June 2006 (UTC)[reply]

05C45 Eulerian and Hamiltonian graphs

[edit]
NM: 1. Paul August ☎ 20:37, 7 June 2006 (UTC)[reply]
Paul August ☎ 17:44, 7 June 2006 (UTC)[reply]
Paul August ☎ 17:59, 7 June 2006 (UTC)[reply]
Paul August ☎ 18:46, 7 June 2006 (UTC)[reply]
Fleury's algorithm redirects to Eulerian path. Paul August ☎ 18:59, 7 June 2006 (UTC)[reply]
Paul August ☎ 19:01, 7 June 2006 (UTC)[reply]
Paul August ☎ 19:03, 7 June 2006 (UTC)[reply]
Paul August ☎ 19:05, 7 June 2006 (UTC)[reply]
Paul August ☎ 19:06, 7 June 2006 (UTC)[reply]
Paul August ☎ 20:22, 7 June 2006 (UTC)[reply]
Paul August ☎ 20:26, 7 June 2006 (UTC)[reply]
Not sure we need this one. Paul August ☎ 20:34, 7 June 2006 (UTC)[reply]
Paul August ☎ 20:37, 7 June 2006 (UTC)[reply]

05C50 Graphs and matrices

[edit]
Radagast3 (talk) 12:51, 27 March 2009 (UTC)[reply]
Radagast3 (talk) 07:50, 18 February 2010 (UTC)[reply]

05C60 Isomorphism problems (reconstruction conjecture, etc.) (complete)

[edit]
All article processed. Paul August ☎ 20:37, 7 June 2006 (UTC)[reply]
Rich Farmbrough 20:25, 26 August 2005 (UTC)[reply]

05C62 Graph representations (geometric and intersection representations, etc.) (complete)

[edit]

05C65 Hypergraphs

[edit]
NM: 1. Paul August ☎ 04:19, 16 June 2006 (UTC)[reply]
NC: 1. Paul August ☎ 04:19, 16 June 2006 (UTC)[reply]
Rich Farmbrough 20:50, 26 August 2005 (UTC)[reply]
This article, together with the PM article criterion for a near-linear space being a linear space above, need to be copied to something like linear space (geometry). Paul August ☎ 04:19, 16 June 2006 (UTC)[reply]
Paul August ☎ 20:43, 7 June 2006 (UTC)[reply]

05C69 Dominating sets, independent sets, cliques

[edit]
NM: 1. Paul August ☎ 01:44, 8 June 2006 (UTC)[reply]
Paul August ☎ 01:21, 8 June 2006 (UTC)[reply]
Paul August ☎ 01:30, 8 June 2006 (UTC)[reply]
Mantel's theorem redirects to Turán's theorem. Paul August ☎ 01:39, 8 June 2006 (UTC)[reply]
Paul August ☎ 01:44, 8 June 2006 (UTC)[reply]

05C70 Factorization, matching, covering and packing

[edit]
NM: 4. Paul August ☎ 20:33, 22 June 2006 (UTC)[reply]
NC: 1. Paul August ☎ 20:33, 22 June 2006 (UTC)[reply]
Currently bipartite matching redirects to matching. Paul August ☎ 12:42, 8 June 2006 (UTC)[reply]
Paul August ☎ 13:05, 8 June 2006 (UTC)[reply]
Paul August ☎ 14:00, 8 June 2006 (UTC)[reply]
Paul August ☎ 20:33, 22 June 2006 (UTC)[reply]
Paul August ☎ 18:50, 11 June 2006 (UTC)[reply]
Paul August ☎ 02:56, 9 June 2006 (UTC)[reply]
Paul August ☎ 02:41, 9 June 2006 (UTC)[reply]

05C75 Structural characterization of types of graphs

[edit]
NM: 2. Paul August ☎ 17:47, 8 June 2006 (UTC)[reply]
Rich Farmbrough 21:03, 26 August 2005 (UTC)[reply]
Rich Farmbrough 20:56, 26 August 2005 (UTC)[reply]
Paul August ☎ 17:47, 8 June 2006 (UTC)[reply]
Paul August ☎ 17:47, 8 June 2006 (UTC)[reply]

05C78 Graph labelling (graceful graphs, bandwidth, etc.)

[edit]

05C80 Random graphs (complete)

[edit]
All articles processed. Paul August ☎ 17:49, 8 June 2006 (UTC)[reply]
Rich Farmbrough 20:59, 26 August 2005 (UTC)[reply]
Rich Farmbrough 20:59, 26 August 2005 (UTC)[reply]

05C85 Graph algorithms (complete)

[edit]

05C90 Applications (complete)

[edit]
All articles processed. Paul August ☎ 19:27, 9 June 2006 (UTC)[reply]
Rich Farmbrough 21:30, 22 August 2005 (UTC)[reply]

05C99 Miscellaneous

[edit]
NM: 11. Paul August ☎ 03:28, 16 June 2006 (UTC)[reply]
NC: 4. Paul August ☎ 03:28, 16 June 2006 (UTC)[reply]
Currently block (graph theory) redirects to Glossary of graph theory. Paul August ☎ 18:29, 8 June 2006 (UTC)[reply]
Paul August ☎ 02:14, 9 June 2006 (UTC)[reply]
Paul August ☎ 02:19, 9 June 2006 (UTC)[reply]
Paul August ☎ 04:10, 9 June 2006 (UTC)[reply]
The PM article is unable to be accessed. Paul August ☎ 21:04, 22 June 2006 (UTC)[reply]
Paul August ☎ 04:17, 9 June 2006 (UTC)[reply]
Paul August ☎ 04:21, 9 June 2006 (UTC)[reply]
Paul August ☎ 04:30, 9 June 2006 (UTC)[reply]
Paul August ☎ 04:38, 9 June 2006 (UTC)[reply]
Paul August ☎ 22:24, 15 June 2006 (UTC)[reply]
Paul August ☎ 03:04, 10 June 2006 (UTC)[reply]
Paul August ☎ 01:01, 11 June 2006 (UTC)[reply]
Paul August ☎ 18:54, 11 June 2006 (UTC)[reply]
Paul August ☎ 19:56, 11 June 2006 (UTC)[reply]
Paul August ☎ 19:51, 11 June 2006 (UTC)[reply]
Currently order (graph theory) redirects to Glossary of graph theory, but I think it could have its own article, (see Bollobas, Bela; Modern Graph Theory, Springer; 1st edition (August 12, 2002). ISBN 0387984887) Paul August ☎ 20:06, 11 June 2006 (UTC)[reply]
Paul August ☎ 02:51, 16 June 2006 (UTC)[reply]
Paul August ☎ 04:24, 13 June 2006 (UTC)[reply]
Paul August ☎ 03:25, 16 June 2006 (UTC)[reply]
Could perhaps be merged with the PM article "order (of a graph)" above to create a single WP article called something like "order and size of a graph". Paul August ☎ 05:41, 22 June 2006 (UTC)[reply]
Curently subdivision (graph theory) redirects to Homeomorphism (graph theory) but it should have its own article. Paul August ☎ 22:17, 15 June 2006 (UTC)[reply]
Currently subgraph redirects to glossary of graph theory, where most (but not all!) of this content exists, but I think subgraph should have its own article. Paul August ☎ 19:21, 9 June 2006 (UTC)[reply]
Paul August ☎ 19:12, 9 June 2006 (UTC)[reply]
Currently Wagner's theorem redirects to Planar graph. Paul August ☎ 19:08, 9 June 2006 (UTC)[reply]
Paul August ☎ 18:58, 9 June 2006 (UTC)[reply]
Paul August ☎ 21:21, 15 June 2006 (UTC)[reply]

05Cxx Graph theory

[edit]

05D05 Extremal set theory

[edit]
NM: 1. Paul August ☎ 18:56, 9 June 2006 (UTC)[reply]
The conections to Sperner familys and Sperner's theorem, should be indicated. Paul August ☎ 18:56, 9 June 2006 (UTC)[reply]
Paul August ☎ 18:50, 9 June 2006 (UTC)[reply]

05D10 Ramsey theory

[edit]
NC: 1. Paul August ☎ 21:02, 22 June 2006 (UTC)[reply]
Paul August ☎ 18:39, 9 June 2006 (UTC)[reply]
Paul August ☎ 17:52, 9 June 2006 (UTC)[reply]
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Seems that the PM article was copied from the WP article anyway (or vice versa). Terry 04:31, 15 Feb 2005 (UTC)

05D15 Transversal (matching) theory (complete)

[edit]
All articles processed. Paul August ☎ 04:52, 9 June 2006 (UTC)[reply]
Rich Farmbrough 21:27, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:27, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:18, 26 August 2005 (UTC)[reply]

05D40 Probabilistic methods (complete)

[edit]

05D99 Miscellaneous

[edit]
  • PM: tight, id=9207new! -- WP guess: tight -- Status:

05Dxx Extremal combinatorics

[edit]

05E05 Symmetric functions

[edit]
NM: 2. Paul August ☎ 16:42, 9 June 2006 (UTC)[reply]
Paul August ☎ 16:39, 9 June 2006 (UTC)[reply]
linas 04:53, 22 August 2005 (UTC)[reply]
Paul August ☎ 16:42, 9 June 2006 (UTC)[reply]

05E15 Combinatorial problems concerning the classical groups

[edit]

05E35 Orthogonal polynomials (complete)

[edit]
All article processed. Paul August ☎ 17:12, 9 June 2006 (UTC)[reply]
Rich Farmbrough 21:07, 26 August 2005 (UTC)[reply]

05E99 Miscellaneous (complete)

[edit]
All articles processed Paul August ☎ 17:13, 9 June 2006 (UTC)[reply]
Rich Farmbrough 21:04, 26 August 2005 (UTC)[reply]

05Exx Algebraic combinatorics

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Wikipedia:WikiProject_Mathematics/PlanetMath_Exchange/05-XX_Combinatorics&oldid=1136065044"