Explicit construction of regular graphs without small cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3214405 (Why is no real title available?)
- scientific article; zbMATH DE number 3223528 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- Explicit constructions of graphs without short cycles and low density codes
Cited in
(24)- scientific article; zbMATH DE number 4059444 (Why is no real title available?)
- Kissing numbers of regular graphs
- Keyed hash function from large girth expander graphs
- Colouring graphs with forbidden bipartite subgraphs
- On the girth of random Cayley graphs
- Regular graphs with no homomorphisms onto cycles
- Weak degeneracy of graphs
- Low-distortion embeddings of graphs with large girth
- New examples of graphs without small cycles and of large size
- The second eigenvalue of regular graphs of given girth
- On the girth of infinite graphs
- A new series of dense graphs of high girth
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Cops and robbers in graphs with large girth and Cayley graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Triples and hexagons
- Cayley type graphs and cubic graphs of large girth
- Conformal growth rates and spectral geometry on distributional limits of graphs
- On the homogeneous algebraic graphs of large girth and their applications
- On a pursuit game on Cayley graphs
- Regular graphs of large girth and arbitrary degree
- Ramanujan graphs
- Exponentially many perfect matchings in cubic graphs
- Turán problems for integer-weighted graphs
This page was built for publication: Explicit construction of regular graphs without small cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790830)
