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 partitions
Search options not deleted
user 4176
20
votes
6
answers
872
views
Hamiltonian paths where the vertices are integer partitions
It concerns the set of all integer partitions of n.
Let the vertices of the graph G=G(n) denote all the p(n) integer partitions of n. … So, for example, the partitions (3,2,1) and (3,3) of 6 are linked because we can move the dot in the last row to the second row. …
- 323