On the public citation graph

A lower bound for the recognition of digraph properties

0 signed · 21 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/bf02565743openalex-snapshot
Fixed-point sets of group actions on finite acyclic complexes
inferredcites →https://doi.org/10.1007/bf02579140openalex-snapshot
A topological approach to evasiveness
inferredcites →https://doi.org/10.1016/0095-8956(80)90057-xopenalex-snapshot
Further results on the Aanderaa-Rosenberg conjecture
inferredcites →https://doi.org/10.1016/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1137/0217031openalex-snapshot
Monotone Bipartite Graph Properties are Evasive
inferredcites →https://doi.org/10.1145/1008299.1008302openalex-snapshot
On the time required to recognize properties of graphs
inferredcites →https://doi.org/10.1201/9780429493911openalex-snapshot
Elements of Algebraic Topology
inferredcites →https://doi.org/10.2307/2371271openalex-snapshot
Fixed-Point Theorems for Periodic Transformations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032916.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118595091.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_22openalex-snapshot
Elusiveness of Finding Degrees
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/bf01844851openalex-snapshot
On the recognition complexity of some graph properties
inferred← citeshttps://doi.org/10.1007/bf02669693openalex-snapshot
On the elusiveness of Hamiltonian property
inferred← citeshttps://doi.org/10.1007/s00493-010-2485-3openalex-snapshot
An asymptotic bound for the complexity of monotone graph properties
inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.009openalex-snapshot
Elusiveness of finding degrees
inferred← citeshttps://doi.org/10.1137/120888703openalex-snapshot
A Lower Bound for the Complexity of Monotone Graph Properties
inferred← citeshttps://doi.org/10.1137/s009753979119415xopenalex-snapshot
Some Results on Elusive Graph Properties
inferred← citeshttps://doi.org/10.1561/0400000055openalex-snapshot
Evasiveness of Graph Properties and Topological Fixed-Point Theorems
inferred← citeshttps://doi.org/10.1561/9781601986658openalex-snapshot
Evasiveness of Graph Properties and Topological Fixed-Point Theorems
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.