On the public citation graph

Explicit construction of regular graphs without small cycles

https://doi.org/10.1007/bf02579157
0 signed · 53 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-43932-7_8openalex-snapshot
8 Categories and Groupoids
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1007/bfb0069177openalex-snapshot
Subgroup theorems and graphs
inferredcites →https://doi.org/10.2307/2314941openalex-snapshot
Combinatorial Group Theory.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/jgt.10012openalex-snapshot
Turán problems for integer‐weighted graphs
inferred← citeshttps://doi.org/10.1002/jgt.22541openalex-snapshot
Multithreshold graphs
inferred← citeshttps://doi.org/10.1002/jgt.22938openalex-snapshot
Weak degeneracy of graphs
inferred← citeshttps://doi.org/10.1002/rsa.20266openalex-snapshot
On the girth of random Cayley graphs
inferred← citeshttps://doi.org/10.1002/rsa.v35:1openalex-snapshot
inferred← citeshttps://doi.org/10.1006/jctb.1996.0032openalex-snapshot
Snarks without Small Cycles
inferred← citeshttps://doi.org/10.1007/978-3-031-66431-1_37openalex-snapshot
Walks on Algebraic Small World Graphs of Large Girth and New Secure Stream Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_129openalex-snapshot
Extremal Hypergraphs and Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_28openalex-snapshot
A Network Creation Game with Nonuniform Interests
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_7openalex-snapshot
The History of Degenerate (Bipartite) Extremal Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-44893-9_7openalex-snapshot
On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/bf02126799openalex-snapshot
Ramanujan graphs
inferred← citeshttps://doi.org/10.1007/bf02579201openalex-snapshot
On a pursuit game on cayley graphs
inferred← citeshttps://doi.org/10.1007/bf02988311openalex-snapshot
Triplets and Hexagons
inferred← citeshttps://doi.org/10.1007/s00493-014-2897-6openalex-snapshot
Regular graphs of large girth and arbitrary degree
inferred← citeshttps://doi.org/10.1007/s00493-021-4671-xopenalex-snapshot
Kissing Numbers of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s10958-007-0453-2openalex-snapshot
On linguistic dynamical systems, families of graphs of large girth, and cryptography
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90072-2openalex-snapshot
On the girth of infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90020-xopenalex-snapshot
The second eigenvalue of regular graphs of given girth
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90033-3openalex-snapshot
Cops and robbers in graphs with large girth and Cayley graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00058-lopenalex-snapshot
Explicit construction of graphs with an arbitrary large girth and of large size
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50025-7openalex-snapshot
10.1016/b978-044488002-4/50025-7
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50034-8openalex-snapshot
10.1016/b978-044488002-4/50034-8
inferred← citeshttps://doi.org/10.1016/j.aim.2011.03.015openalex-snapshot
Exponentially many perfect matchings in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jfa.2012.01.020openalex-snapshot
Low-distortion embeddings of graphs with large girth
inferred← citeshttps://doi.org/10.1016/j.laa.2008.08.023openalex-snapshot
On the homogeneous algebraic graphs of large girth and their applications
inferred← citeshttps://doi.org/10.1017/9781316755723.013openalex-snapshot
Bisimulation invariance and finite models
inferred← citeshttps://doi.org/10.1017/s0963548322000104openalex-snapshot
Colouring graphs with forbidden bipartite subgraphs
inferred← citeshttps://doi.org/10.1023/a:1005919327201openalex-snapshot
On the Varieties of Parabolic Subgroups, their Generalizations and Combinatorial Applications
inferred← citeshttps://doi.org/10.1023/a:1020643711475openalex-snapshot
On Nesterov's Approach to Semi-infinite Programming
inferred← citeshttps://doi.org/10.1023/a:1020686216463openalex-snapshot
Graphs with Special Arcs and Cryptography
inferred← citeshttps://doi.org/10.1090/s0273-0979-1995-00569-0openalex-snapshot
A new series of dense graphs of high girth
inferred← citeshttps://doi.org/10.1109/26.2752openalex-snapshot
Asymptotic results for partial concentrators
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238182openalex-snapshot
On the Implementation of Huge Random Objects
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22437.xopenalex-snapshot
Cubic Graphs with Large Girth
inferred← citeshttps://doi.org/10.1137/0402034openalex-snapshot
Random Sequential Adsorption on Graphs
inferred← citeshttps://doi.org/10.1137/0404012openalex-snapshot
The Expected Capacity of Concentrators
inferred← citeshttps://doi.org/10.1137/s0895480101387893openalex-snapshot
A High Girth Graph Construction
inferred← citeshttps://doi.org/10.11575/cdm.v2i1.61890openalex-snapshot
Coloring edges and vertices of graphs without short or long cycles
inferred← citeshttps://doi.org/10.1214/20-aop1480openalex-snapshot
Conformal growth rates and spectral geometry on distributional limits of graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.73.613openalex-snapshot
On the extremal values of ratios of number of paths
inferred← citeshttps://doi.org/10.37236/1386openalex-snapshot
Constructions for Cubic Graphs with Large Girth
inferred← citeshttps://doi.org/10.37236/37openalex-snapshot
Dynamic Cage Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1506.04822openalex-snapshot
Some Improvements on Locally Repairable Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06936openalex-snapshot
Graphs with large girth and free groups
inferred← citeshttps://doi.org/10.48550/arxiv.2010.03177openalex-snapshot
Long-range order in discrete spin systems
inferred← citeshttps://doi.org/10.51286/albjm/1656414764openalex-snapshot
KEYED HASH FUNCTION FROM LARGE GIRTH EXPANDER GRAPHS
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.