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 17798
This tag is used if a reference is needed in a paper or textbook on a specific result.
1
vote
Proving that every strongly connected tournament T on at least 4 vertices contains distinct ...
After reading relep's answer I revisited the problem and came up with a different fairly simple proof for Question 1, but before I get to that, I recently found that this problem has a long history al …
- 1,701
14
votes
Books that teach other subjects, written for a mathematician
Programming for Mathematicians by Raymond Seroul.
I recommend reading the highly entertaining amazon review by Ian Jakovenko. He refers to the book as "Euclid's Elements for Cybernauts."
3
votes
2
answers
2k
views
Proving that every strongly connected tournament T on at least 4 vertices contains distinct ...
I have a two part question:
Is there a simple proof that every strongly connected tournament $T$ on $n\geq 4$ vertices contains distinct $u,v\in V(T)$ such that $T-u$ and $T-v$ are strongly connected …
- 1,701
8
votes
Longest increasing subsequence as measure of randomness
This is by no means a complete answer, but I think section 7 of the following paper would be a good starting point to learn about the existing literature for this question.
Steele, J. Michael, Variati …
- 1,701