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 erdos
Search options not deleted
user 99647
For questions related to the work of Paul Erdős, especially the many results and conjectures which bear his name.
2
votes
1
answer
707
views
When an Erdos-Renyi graph is locally tree like?
Furthermore, "most" sparse
graphs have logarithmic diameter (say, random regular graphs of
constant degree $d\geq3$, or the giant component of Erdos-Rényi random
graphs with $p=\frac{c}{n}$ and $ …
- 21