On the public citation graph

Some Results Related to the Evasiveness Conjecture

0 signed · 27 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.1002/jgt.3190120106openalex-snapshot
Searching for an edge in a graph
inferredcites →https://doi.org/10.1006/jsco.1993.1056openalex-snapshot
The Transitive Groups of Degree Fourteen and Fifteen
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/s00454-001-0057-4openalex-snapshot
Examples of Z-Acyclic and Contractible Vertex-Homogeneous Simplicial Complexes
inferredcites →https://doi.org/10.1016/0020-0190(78)90081-9openalex-snapshot
A counterexample to the generalized 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.1016/s0040-9383(98)00009-3openalex-snapshot
COMPLEXES OF NOT i-CONNECTED GRAPHS
inferredcites →https://doi.org/10.1016/s0747-7171(87)80068-8openalex-snapshot
The transitive groups of degree twelve
inferredcites →https://doi.org/10.1080/00927878308822884openalex-snapshot
The transitive groups of degree up to eleven+
inferredcites →https://doi.org/10.1137/0217031openalex-snapshot
Monotone Bipartite Graph Properties are Evasive

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22419openalex-snapshot
The evasiveness conjecture and graphs on vertices
inferred← citeshttps://doi.org/10.1002/jgt.23042openalex-snapshot
Elusive properties of infinite graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_21openalex-snapshot
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
inferred← citeshttps://doi.org/10.1007/s00453-020-00676-9openalex-snapshot
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
inferred← citeshttps://doi.org/10.1007/s00454-001-0057-4openalex-snapshot
Examples of Z-Acyclic and Contractible Vertex-Homogeneous Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s00454-011-9357-5openalex-snapshot
Strong Homotopy Types, Nerves and Collapses
inferred← citeshttps://doi.org/10.1007/s11704-024-3770-4openalex-snapshot
On the exact quantum query complexity of MOD and EXACT functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-411470-8.00012-xopenalex-snapshot
Appendix
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.035openalex-snapshot
Cooperative games on simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.012openalex-snapshot
Any monotone property of 3-uniform hypergraphs is weakly evasive
inferred← citeshttps://doi.org/10.1145/2422436.2422454openalex-snapshot
Evasiveness through a circuit lens
inferred← citeshttps://doi.org/10.1145/2527748.2527763openalex-snapshot
Gems in decision tree complexity revisited
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.17openalex-snapshot
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04412openalex-snapshot
The Evasiveness Conjecture and Graphs on 2p Vertices
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02374openalex-snapshot
On Rivest-Vuillemin Conjecture for Fourteen Variables
inferred← citeshttps://doi.org/10.48550/arxiv.2001.05820openalex-snapshot
Probabilistic values for simplicial complexes
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.