On the public citation graph

A Moore bound for simplicial complexes

0 signed · 31 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.1006/jctb.1994.1054openalex-snapshot
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
inferredcites →https://doi.org/10.1007/978-1-4612-0619-4openalex-snapshot
Modern Graph Theory
inferredcites →https://doi.org/10.1007/bf02762271openalex-snapshot
A family of à n -groups
inferredcites →https://doi.org/10.1007/bf02772543openalex-snapshot
Ramanujan complexes of typeà d
inferredcites →https://doi.org/10.1016/0378-4754(90)90176-jopenalex-snapshot
Lectures on buildings
inferredcites →https://doi.org/10.1016/j.ejc.2004.06.007openalex-snapshot
Explicit constructions of Ramanujan complexes of type Ad
inferredcites →https://doi.org/10.1016/s0012-365x(02)00748-3openalex-snapshot
Ramanujan geometries of type Ãn
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.23444839zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1007/s00373-010-0979-9openalex-snapshot
Higher Dimensional Moore Bounds
inferred← citeshttps://doi.org/10.1007/s00373-011-1113-3openalex-snapshot
Simplicial Girth and Pure Resolutions
inferred← citeshttps://doi.org/10.1007/s11537-014-1265-zopenalex-snapshot
Ramanujan complexes and high dimensional expanders
inferred← citeshttps://doi.org/10.1007/s11856-019-1828-zopenalex-snapshot
Spectrum and combinatorics of two-dimensional Ramanujan complexes
inferred← citeshttps://doi.org/10.1007/s11856-019-1880-8openalex-snapshot
The theta number of simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103535openalex-snapshot
On the spectrum and linear programming bound for hypergraphs
inferred← citeshttps://doi.org/10.1093/imrn/rnv022openalex-snapshot
Mixing Properties and the Chromatic Number of Ramanujan Complexes
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00029openalex-snapshot
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders
inferred← citeshttps://doi.org/10.1137/1.9781611973099.5openalex-snapshot
On Multiplicative λ-Approximations and Some Geometric Applications
inferred← citeshttps://doi.org/10.1137/100801809openalex-snapshot
On Multiplicative $\lambda$-Approximations and Some Geometric Applications
inferred← citeshttps://doi.org/10.1137/20m1383689openalex-snapshot
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
inferred← citeshttps://doi.org/10.1142/9789813272880_0027openalex-snapshot
HIGH DIMENSIONAL EXPANDERS
inferred← citeshttps://doi.org/10.1145/3406325.3451029openalex-snapshot
New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ n log k n ) distance
inferred← citeshttps://doi.org/10.1145/3519935.3520024openalex-snapshot
Locally testable codes with constant rate, distance, and locality
inferred← citeshttps://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferred← citeshttps://doi.org/10.37236/3851openalex-snapshot
On Regular Hypergraphs of High Girth
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.762openalex-snapshot
Exchangeability and Realizability: De Finetti Theorems on Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1002.3541openalex-snapshot
Finite Volume Spaces and Sparsification
inferred← citeshttps://doi.org/10.48550/arxiv.1407.7700openalex-snapshot
Mixing properties and the chromatic number of Ramanujan complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02664openalex-snapshot
The Ramanujan Property for Simplicial Complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1606.01098openalex-snapshot
Highlights from "The Ramanujan Property for Simplicial Complexes" [arXiv:1605.02664]
inferred← citeshttps://doi.org/10.5555/2095116.2095121openalex-snapshot
On multiplicative λ-approximations and some geometric applications
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.