Explicit construction of regular graphs without small cycles

DOI10.1007/BF02579157MaRDI QIDQ790830zbMATH OpenFDO

Authors Wilfried Imrich

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02579157

zbMATH Keywords

Cayley graphsgirth

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

Recommendations

• Regular graphs of large girth and arbitrary degree
• On the girth of random Cayley graphs
• Cayley cages
• Cayley type graphs and cubic graphs of large girth
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

Cites work

• Explicit constructions of graphs without short cycles and low density codes
• 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?)

Cited in

(26)

• On the homogeneous algebraic graphs of large girth and their applications
• On a pursuit game on Cayley graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• Ramanujan graphs
• New examples of graphs without small cycles and of large size
• Regular graphs with no homomorphisms onto cycles
• Explicit construction of graphs with an arbitrary large girth and of large size
• Cayley type graphs and cubic graphs of large girth
• Conformal growth rates and spectral geometry on distributional limits of graphs
• Logarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\)
• Kissing numbers of regular graphs
• On the girth of random Cayley graphs
• Turán problems for integer-weighted graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• scientific article; zbMATH DE number 4059444 (Why is no real title available?)
• Low-distortion embeddings of graphs with large girth
• A new series of dense graphs of high girth
• Regular graphs of large girth and arbitrary degree
• Keyed hash function from large girth expander graphs
• Exponentially many perfect matchings in cubic graphs
• Colouring graphs with forbidden bipartite subgraphs
• Weak degeneracy of graphs
• On the girth of infinite graphs
• Triples and hexagons
• Degrees and gaps: tight complexity results of general factor problems parameterized by treewidth and cutwidth
• The second eigenvalue of regular graphs of given girth

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)