Regular graphs of large girth and arbitrary degree
From MaRDI portal
Publication:485001
DOI10.1007/s00493-014-2897-6zbMath1340.05117arXiv1110.5259OpenAlexW2004229660MaRDI QIDQ485001
Publication date: 8 January 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.5259
Related Items (11)
Containment: a variation of cops and robber ⋮ A randomized construction of high girth regular graphs ⋮ First-order Logic with Connectivity Operators ⋮ Balanced allocation on hypergraphs ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model ⋮ Balanced allocation on dynamic hypergraphs ⋮ Balanced Allocation on Graphs: A Random Walk Approach ⋮ Kissing numbers of regular graphs ⋮ Disjoint Chorded Cycles of the Same Length ⋮ Results and problems on chorded cycles: a survey ⋮ Distributed Lower Bounds for Ruling Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit construction of regular graphs without small cycles
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit construction of graphs with an arbitrary large girth and of large size
- Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
- On the girth of random Cayley graphs
- Expander graphs and their applications
- A recursive approach to low complexity codes
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Harald Cramér and the distribution of prime numbers
- Primes in arithmetic progressions
This page was built for publication: Regular graphs of large girth and arbitrary degree
