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 41139
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
Accepted
Number of Nice Matrices
Ok, the posibillity of no formula existing fascinated me so I followed Wolfgang's advise (even if it was not meant for me) and found a formula on the internet. I quote:
Theorem 3. Let $p(z)$ be a …
- 2,493
0
votes
Accepted
Regular graph such that $2$ distinct vertices have same neighborhood set
An example with $k = 4$ is the octahedron.
- 2,493