Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 1015
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
Table of planar connected graphs
Close to what you are looking for, there is
An Atlas of the Smaller Maps in Orientable and Nonorientable Surfaces by David Jackson and Terry I. Visentin. (CRC press) (Google books)
This book inclu …
- 3,393
6
votes
Replacing logician-constructive with combinatorist-constructive?
so just to be clear, the reason the finite versions of Ramsey's theorem and the pigeonhole principle are intuitionistic is because you have an explicit bound on the search space. If the search space …
- 3,393
10
votes
2
answers
263
views
equivalence classes of arch diagrams in bijection with permutations
By an arch diagram of size $n$, I mean a diagram consisting of $n$ arches matching $2n$ points, where the points are ordered on a line running from left to right. An arch diagram is basically just a w …
- 3,393
2
votes
1
answer
418
views
efficient arithmetic with (short) Conway games?
We consider "games" in the sense of ONAG. Conway's definition of a game $G$ as a pair $G = \{L \mid R \}$ of sets of games, together with the definitions of inequality and the arithmetic operations ( …
- 3,393
1
vote
2
answers
372
views
How to understand a rooting of a dessin d'enfant?
As I understand it, rooted maps on surfaces were first introduced in enumerative combinatorics because they are easier to count than unrooted maps, which can have non-trivial symmetries. A map is a gr …
- 3,393
8
votes
History of deletion-contraction formula
Not exactly a reference, but I found some discussion of this formula in Bill Tutte's graph-theoretic memoirs, Graph Theory as I Have Known it (Oxford, 1998). In Chapter 5 ("Algebra in Graph Theory"), …
- 3,393
4
votes
Enumerating all inequivalent planar embeddings of a planar graph
As suggested by Henrik Rüping in the comments, this problem can be solved in principle using the representation of embeddings by permutations, i.e., using combinatorial maps (aka "rotation systems" ak …
- 3,393