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 expander-graphs
Search options not deleted
user 34591
An expander graph is a graph in which small sets of vertices have large 'boundary'. Ramanujan graphs are examples of expanders.
6
votes
How to prove a random d-regular graph is an expander with prob >= 0.5?
Pinsker's original paper is now available online in the archive of the International Teletraffic Congress: https://itc-conference.org/itc-library/itc07.html
Pinsker, Mark S.
On the Complexity of a Con …
- 245