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 ramanujan
Search options not deleted
user 97087
1
vote
1
answer
162
views
Solutions to Diophantine equation for Ramanujan graph construction
I am working with so-called Ramanujan graphs which have the property that a lower bound on their girth can be stated. … b,c,d$ are even.
if $p\equiv 3 \mod{4}$ then $a>0$ odd; $b,c$ odd and $d$ even
It is stated that such a diophantine equation has several answers and so by using them you can construct the associated Ramanujan …
