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 4558
An expander graph is a graph in which small sets of vertices have large 'boundary'. Ramanujan graphs are examples of expanders.
2
votes
2
answers
191
views
Ramanujan graphs from varieties over finite fields
Let $G$ be a $d$-regular graph. Let $d= \lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n \ge -d $ be the eigenvalues of the adjacency matrix of $G$, and set $\lambda = \max (|\lambda_2| , |\lambda_n|) …
- 148k
0
votes
Ramanujan graphs from varieties over finite fields
Someone pointed me to a reference that answers my question about whether this example is new, so I will answer my own question in case it is helpful for anyone else.
This paper:
https://dl.acm.org/doi …
- 7,857
4
votes
0
answers
263
views
What are the best bounds to date on the maximum girth of a cubic graph?
The girth of a graph is the length of its smallest cycle. Studying the maximum possible girth for a $k$-regular graph on $n$ vertices is a very well-studied problem.
In the 1988 paper "Ramanujan grap …
- 7,857
9
votes
1
answer
259
views
Do there exist "expanding" $1$-skeletons of simple $4$-polytopes?
Let $\{ G_n \}_{n \ge 1}$ be a sequence of graphs such that the number of vertices of $G_n$ tends to $\infty$ as $n \to \infty$. We say that $\{ G_n \}_{n \ge 1}$ is an expander family if
$\lambda_2( …
- 24.7k