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 140707
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
0
votes
Acyclic orientations of complete graphs in terms of Stirling numbers?
Ok, this is 10 years late, and it might just be kicking the can down the road, but: the number of acyclic orientations of a graph $G$ is equal to the number of Coxeter elements (elements with exactly …
- 111
0
votes
Accepted
Circular (bracelets) permutations with alike things(reflections are equivalent) using polya ...
Answer based on Max Alekseyev's helpful comments.
Unlike the cyclic group, using which all rotations are equivalent, under the dihedral group all rotations as well as reflections are equivalent.
Intui …
- 111
1
vote
1
answer
193
views
Circular (bracelets) permutations with alike things(reflections are equivalent) using polya ... [closed]
Circular permutations of N objects of n1 are identical of one type, n2 are identical of another type and so on, such that n1+n2+n3+..... = N?
A similar question exists but it doesn't address the case …
- 111