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 reference-request
Search options not deleted
user 2096
This tag is used if a reference is needed in a paper or textbook on a specific result.
3
votes
Generalization of plane geometric trees?
Also check out the House with One Room notes form Allen Hatcher
2
votes
Proofs without words
For $0 \lt k \lt n$,
$$\binom{n}{k} = \frac{n}{n-k}\binom{n-1}{k}$$
How k-subsets of [n], marked dark green in the rows, come from k-subsets of [n-1] after n-fold duplication and rearrangement:
…