On the public citation graph

On the recognition complexity of some graph properties

0 signed · 25 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/bf02122695openalex-snapshot
A lower bound for the recognition of digraph properties
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.1007/bfb0063003openalex-snapshot
Elusive properties
inferredcites →https://doi.org/10.1016/0012-365x(91)90008-popenalex-snapshot
Some results on the complexity of families of sets
inferredcites →https://doi.org/10.1016/0095-8956(76)90021-6openalex-snapshot
Complete subgraphs are elusive
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/0097-3165(76)90042-xopenalex-snapshot
Reflection classes whose cubes cover the alternating group
inferredcites →https://doi.org/10.1016/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1137/0217031openalex-snapshot
Monotone Bipartite Graph Properties are Evasive
inferredcites →https://doi.org/10.1137/s009753979119415xopenalex-snapshot
Some Results on Elusive Graph Properties
inferredcites →https://doi.org/10.1145/1008299.1008302openalex-snapshot
On the time required to recognize properties of graphs
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.2307/2371271openalex-snapshot
Fixed-Point Theorems for Periodic Transformations
inferredcites →https://doi.org/10.24033/asens.961openalex-snapshot
La structure des $p$-groupes de Sylow des groupes symétriques finis

What points at this work

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

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.1137/120888703openalex-snapshot
A Lower Bound for the Complexity of Monotone Graph Properties
inferred← citeshttps://doi.org/10.1137/s0097539700382005openalex-snapshot
Evasiveness of Subgraph Containment and Related Properties
inferred← citeshttps://doi.org/10.1145/2688073.2688085openalex-snapshot
Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive
inferred← citeshttps://doi.org/10.1145/3313908openalex-snapshot
Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive
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
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2445openalex-snapshot
Evasiveness and the Distribution of Prime Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2717openalex-snapshot
Chio Condensation and Random Sign Matrices
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.