On the public citation graph
Random Graph Coverings I: General Theory and Graph Connectivity
0 signed · 71 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190140208openalex-snapshot
On the parity of planar covers
inferredcites →https://doi.org/10.1007/978-1-4612-4372-4openalex-snapshot
Classical Topology and Combinatorial Group Theory
inferredcites →https://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferredcites →https://doi.org/10.1016/0012-365x(88)90090-8openalex-snapshot
The spherical genus and virtually planar graphs
inferredcites →https://doi.org/10.1016/0095-8956(82)90042-9openalex-snapshot
Finite common coverings of graphs
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1065928-2openalex-snapshot
Uniform Tree Lattices
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.22176openalex-snapshot
Spectrum of random d‐regular graphs up to the edge
inferred← citeshttps://doi.org/10.1002/rsa.70000openalex-snapshot
DP‐Coloring of Graphs From Random Covers
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_16openalex-snapshot
Cops and Robber on Some Families of Oriented Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-44097-8_13openalex-snapshot
Signatures, Lifts, and Eigenvalues of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-46301-8_29openalex-snapshot
Supernodes-Based Solution for Terrestrial Segment of Flying Ubiquitous Sensor Network Under Intentional Electromagnetic Interference
inferred← citeshttps://doi.org/10.1007/s00039-024-00692-9openalex-snapshot
Universality and Sharp Matrix Concentration Inequalities
inferred← citeshttps://doi.org/10.1007/s00220-019-03473-wopenalex-snapshot
$$L^p$$ Norms and Support of Eigenfunctions on Graphs
inferred← citeshttps://doi.org/10.1007/s00222-014-0560-xopenalex-snapshot
Expansion of random graphs: new proofs, new results
inferred← citeshttps://doi.org/10.1007/s00493-006-0029-7openalex-snapshot
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
inferred← citeshttps://doi.org/10.1007/s40879-024-00803-8openalex-snapshot
Stability of homomorphisms, coverings and cocycles I: equivalence
inferred← citeshttps://doi.org/10.1016/j.aim.2011.03.016openalex-snapshot
Spectra of lifted Ramanujan graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2017.10.042openalex-snapshot
Ramanujan coverings of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.05.005openalex-snapshot
Hamilton cycles in random lifts of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.001openalex-snapshot
Hamilton cycles in random lifts of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.051openalex-snapshot
The chromatic number of random lifts of
inferred← citeshttps://doi.org/10.1016/j.jfa.2021.108988openalex-snapshot
Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.016openalex-snapshot
Cops and Robber on some families of oriented graphs
inferred← citeshttps://doi.org/10.1016/s0169-7161(03)21004-xopenalex-snapshot
Ch. 2. Models of random graphs and their applications
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548305007273openalex-snapshot
Random Lifts of Graphs: Edge Expansion
inferred← citeshttps://doi.org/10.1017/s0963548309990654openalex-snapshot
On the Number of Perfect Matchings in Random Lifts
inferred← citeshttps://doi.org/10.1017/s1474748020000663openalex-snapshot
CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS
inferred← citeshttps://doi.org/10.1090/memo/1100openalex-snapshot
Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks
inferred← citeshttps://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferred← citeshttps://doi.org/10.1090/s0894-0347-2014-00796-7openalex-snapshot
Measure preserving words are primitive
inferred← citeshttps://doi.org/10.1109/focs.2004.19openalex-snapshot
Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00101openalex-snapshot
Explicit near-fully X-Ramanujan graphs
inferred← citeshttps://doi.org/10.1109/tit.2015.2466598openalex-snapshot
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
inferred← citeshttps://doi.org/10.1137/060670808openalex-snapshot
Hamilton Cycles in Random Lifts of Directed Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.146openalex-snapshot
Counting matchings in irregular bipartite graphs and random lifts
inferred← citeshttps://doi.org/10.1137/110838078openalex-snapshot
Random Lifts of $K_5\backslashe$ are 3-Colorable
inferred← citeshttps://doi.org/10.1137/19m1243026openalex-snapshot
Find Your Place: Simple Distributed Algorithms for Community Detection
inferred← citeshttps://doi.org/10.1137/25m180603xopenalex-snapshot
Spectral Statistics of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1145/2897518.2897574openalex-snapshot
Ramanujan coverings of graphs
inferred← citeshttps://doi.org/10.1145/3564246.3585183openalex-snapshot
New High Dimensional Expanders from Covers
inferred← citeshttps://doi.org/10.1214/21-ecp415openalex-snapshot
The spectral norm of random lifts of matrices
inferred← citeshttps://doi.org/10.1215/s0012-7094-03-11812-8openalex-snapshot
Relative expanders or weakly relatively Ramanujan graphs
inferred← citeshttps://doi.org/10.24033/asens.2450openalex-snapshot
A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
inferred← citeshttps://doi.org/10.37236/2783openalex-snapshot
Random Lifts of Graphs are Highly Connected
inferred← citeshttps://doi.org/10.37236/4609openalex-snapshot
On Cylindrical Graph Construction and its Applications
inferred← citeshttps://doi.org/10.3929/ethz-b-000527827openalex-snapshot
The Spectral Norm of Random Lifts of Matrices
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n3.a2openalex-snapshot
The spectrum of random $k$-lifts of large graphs (with possibly large $k$)
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0156openalex-snapshot
Strong approximation in random towers of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0600openalex-snapshot
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1527openalex-snapshot
Random lifts of $K_5\setminus e$ are 3-colourable
inferred← citeshttps://doi.org/10.48550/arxiv.1012.4097openalex-snapshot
The spectrum of random lifts
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2665openalex-snapshot
Sheaves on Graphs and Their Homological Invariants
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2057openalex-snapshot
Hamilton Cycles in Random Lifts of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3767openalex-snapshot
Cylindrical Graph Construction (definition and basic properties)
inferred← citeshttps://doi.org/10.48550/arxiv.1412.6841openalex-snapshot
Signatures, lifts, and eigenvalues of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.01330openalex-snapshot
Randomly Generated Subgroups of the Symmetric Group and Random Lifts of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07139openalex-snapshot
Hamilton Cycles in Random Graphs: a bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.1905.02264openalex-snapshot
Stable multivariate generalizations of matching polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00963openalex-snapshot
Spectrum of Random $d$-regular Graphs Up to the Edge
inferred← citeshttps://doi.org/10.48550/arxiv.2109.13347openalex-snapshot
The chromatic number of random lifts of complete graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2304.05714openalex-snapshot
Norm of matrix-valued polynomials in random unitaries and permutations
inferred← citeshttps://doi.org/10.5802/ahl.187openalex-snapshot
Statistics of finite degree covers of torus knot complements
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.