For every fixed d≥3 and every sufficiently large even n, a deterministic algorithm outputs in polynomial bit time a simple connected nonbipartite d-regular n-vertex graph whose nonconstant adjacency eigenvalues lie strictly between ±2√(d−1).
For every fixed d≥3 and every sufficiently large even n, a deterministic algorithm outputs in polynomial bit time a simple connected nonbipartite d-regular n-vertex graph whose nonconstant adjacency eigenvalues lie strictly between ±2√(d−1).
For every fixed d≥3 and every sufficiently large even n, a deterministic algorithm outputs in polynomial bit time a simple connected nonbipartite d-regular n-vertex graph whose nonconstant adjacency eigenvalues lie strictly between ±2√(d−1).
If correct, gives an explicit exact-threshold construction at all sufficiently large admissible orders for each fixed degree.
Can nonbipartite Ramanujan graphs be built deterministically at every sufficiently large admissible size?
Publication dates and editorial changes.
OpenAI reports deterministic Ramanujan graphs at prescribed large sizes
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
