On the public citation graph

A topological approach to evasiveness

0 signed · 160 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/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1007/bf02565743openalex-snapshot
Fixed-point sets of group actions on finite acyclic complexes
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
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/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.1145/1008299.1008302openalex-snapshot
On the time required to recognize properties of graphs
inferredcites →https://doi.org/10.1145/1811129.1811133openalex-snapshot
On the Aanderaa-Rosenberg Conjecture
inferredcites →https://doi.org/10.1145/800116.803747openalex-snapshot
A generalization and proof of the Aanderaa-Rosenberg conjecture
inferredcites →https://doi.org/10.1145/800119.803888openalex-snapshot
Determining graph properties from matrix representations
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.2307/2313470openalex-snapshot
Algebraic Topology: An Introduction.
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.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.1002/jgt.3190120106openalex-snapshot
Searching for an edge in a graph
inferred← citeshttps://doi.org/10.1002/rsa.20164openalex-snapshot
Improved lower bounds on the randomized complexity of graph properties
inferred← citeshttps://doi.org/10.1002/rsa.20336openalex-snapshot
A new perspective on implementation by voting trees
inferred← citeshttps://doi.org/10.1002/rsa.20841openalex-snapshot
Enumeration and randomized constructions of hypertrees
inferred← citeshttps://doi.org/10.1006/jcom.1999.0521openalex-snapshot
The Rivest–Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables
inferred← citeshttps://doi.org/10.1006/jctb.2000.2000openalex-snapshot
Some Results Related to the Evasiveness Conjecture
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_10openalex-snapshot
Evasiveness of Subgraph Containment and Related Properties
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_9openalex-snapshot
Computing Graph Properties by Randomized Subcube Partitions
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_20openalex-snapshot
Decision problems and Coxeter groups
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_176openalex-snapshot
On linear decision trees computing Boolean functions
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_10openalex-snapshot
The complexity of graph connectivity
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_50openalex-snapshot
On the complexity of partial order properties
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_1openalex-snapshot
Fair-Division Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_2openalex-snapshot
Graph-Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_3openalex-snapshot
Evasiveness of Graph Properties
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_4openalex-snapshot
Embedding and Mapping Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_5openalex-snapshot
Appendix A: Basic Concepts from Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_6openalex-snapshot
Appendix B: Crash Course in Topology
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_7openalex-snapshot
Appendix C: Partially Ordered Sets, Order Complexes, and Their Topology
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_8openalex-snapshot
Appendix D: Groups and Group Actions
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_9openalex-snapshot
Appendix E: Some Results and Applications from Smith Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-09955-2_6openalex-snapshot
Completions and Simple Homotopy
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_10openalex-snapshot
On the Power of Parity Queries in Boolean Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_10openalex-snapshot
Using Brouwer’s Fixed Point Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_11openalex-snapshot
Completions and Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_8openalex-snapshot
New Structures Based on Completions
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_25openalex-snapshot
Query Complexity of Matroids
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/978-3-662-04166-6_24openalex-snapshot
Topology of Colors (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bf01206357openalex-snapshot
An ?(n 4/3) lower bound on the randomized complexity of graph properties
inferred← citeshttps://doi.org/10.1007/bf01375470openalex-snapshot
An ?(n 5/4) lower bound on the randomized complexity of graph properties
inferred← citeshttps://doi.org/10.1007/bf01844851openalex-snapshot
On the recognition complexity of some graph properties
inferred← citeshttps://doi.org/10.1007/bf02122695openalex-snapshot
A lower bound for the recognition of digraph properties
inferred← citeshttps://doi.org/10.1007/bf02187866openalex-snapshot
On lattices with M:obius function ±1, 0
inferred← citeshttps://doi.org/10.1007/bf02669693openalex-snapshot
On the elusiveness of Hamiltonian property
inferred← citeshttps://doi.org/10.1007/bf02950404openalex-snapshot
Decision tree complexity of graph properties with dimension at most 5
inferred← citeshttps://doi.org/10.1007/bfb0083594openalex-snapshot
On a search problem in graph theory
inferred← citeshttps://doi.org/10.1007/s00012-003-1825-1openalex-snapshot
Topology of matching, chessboard, and general bounded degree graph complexes
inferred← citeshttps://doi.org/10.1007/s00453-021-00894-9openalex-snapshot
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
inferred← citeshttps://doi.org/10.1007/s00454-001-0055-6openalex-snapshot
Convex, Acyclic, and Free Sets of an Oriented Matroid
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/s00454-019-00137-3openalex-snapshot
Barycentric Subdivisions of Convex Complexes are Collapsible
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.1007/s00493-016-3149-8openalex-snapshot
Subdivisions, shellability, and collapsibility of products
inferred← citeshttps://doi.org/10.1007/s10711-019-00481-xopenalex-snapshot
Collapsibility of CAT(0) spaces
inferred← citeshttps://doi.org/10.1007/s10801-007-0092-1openalex-snapshot
Complexes of Graphs with Bounded Matching Size
inferred← citeshttps://doi.org/10.1007/s10878-020-00689-8openalex-snapshot
On the relationship between energy complexity and other boolean function measures
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.1007/s11856-021-2184-3openalex-snapshot
The worst way to collapse a simplex
inferred← citeshttps://doi.org/10.1007/s11856-023-2505-9openalex-snapshot
Bipartite perfect matching as a real polynomial
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90204-uopenalex-snapshot
A combinatorial technique for simplicial complexes and some applications to finite groups
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferred← citeshttps://doi.org/10.1016/0196-8858(91)90010-gopenalex-snapshot
Coxeter groups and nonuniform complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90043-hopenalex-snapshot
Topological invariants of classification problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-411470-8.00012-xopenalex-snapshot
Appendix
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50025-7openalex-snapshot
10.1016/b978-044488002-4/50025-7
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50036-1openalex-snapshot
10.1016/b978-044488002-4/50036-1
inferred← citeshttps://doi.org/10.1016/j.aim.2015.10.018openalex-snapshot
Order complexes of coset posets of finite groups are not contractible
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.035openalex-snapshot
Cooperative games on simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111914openalex-snapshot
A hierarchy of dismantlings in graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.04.010openalex-snapshot
The topology of the independence complex
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.05.003openalex-snapshot
Simplicial simple-homotopy of flag complexes in terms of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.10.002openalex-snapshot
Tight complexes in 3-space admit perfect discrete Morse functions
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.07.012openalex-snapshot
A note on the query complexity of the Condorcet winner problem
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.06.015openalex-snapshot
Invariable generation of finite simple groups and rational homology of coset posets
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.09.009openalex-snapshot
One-point suspensions and wreath products of polytopes and spheres
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.02.001openalex-snapshot
Linear colorings of simplicial complexes and collapsing
inferred← citeshttps://doi.org/10.1016/j.jcta.2015.10.002openalex-snapshot
A generalization of a result of Dong and Santos–Sturmfels on the Alexander dual of spheres and balls
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105562openalex-snapshot
Fixed points of group actions on link collapsible 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.1016/j.tcs.2020.09.003openalex-snapshot
New bounds for energy complexity of Boolean functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114422openalex-snapshot
Query complexity of tournament solutions
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00446-0openalex-snapshot
Rivest–Vuillemin conjecture is true for monotone boolean functions with twelve variables
inferred← citeshttps://doi.org/10.1016/s0021-8693(03)00024-3openalex-snapshot
Topology of bounded-degree graph complexes
inferred← citeshttps://doi.org/10.1016/s0040-9383(01)00037-4openalex-snapshot
Alexander duality for projections of polytopes
inferred← citeshttps://doi.org/10.1016/s0040-9383(98)00009-3openalex-snapshot
COMPLEXES OF NOT i-CONNECTED GRAPHS
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00350-8openalex-snapshot
Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
inferred← citeshttps://doi.org/10.1023/a:1006422023869openalex-snapshot
On the Complexity of Partial Order Properties
inferred← citeshttps://doi.org/10.1080/10586458.2013.865281openalex-snapshot
Random Discrete Morse Theory and a New Library of Triangulations
inferred← citeshttps://doi.org/10.1090/pcms/013/04openalex-snapshot
Topics in combinatorial differential topology and geometry
inferred← citeshttps://doi.org/10.1090/pcms/013/09openalex-snapshot
Poset topology: Tools and applications
inferred← citeshttps://doi.org/10.1090/s0002-9939-98-05021-7openalex-snapshot
Order complexes of noncomplemented lattices are nonevasive
inferred← citeshttps://doi.org/10.1093/imrn/rnz055openalex-snapshot
Convex Union Representability and Convex Codes
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00113openalex-snapshot
Nearly Optimal Communication and Query Complexity of Bipartite Matching
inferred← citeshttps://doi.org/10.1109/sct.1990.113955openalex-snapshot
On the power of randomness in the decision tree model
inferred← citeshttps://doi.org/10.1109/sct.1995.514729openalex-snapshot
Decision trees with AND, OR queries
inferred← citeshttps://doi.org/10.1109/sfcs.1986.44openalex-snapshot
Probabilistic Boolean decision trees and the complexity of evaluating game trees
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814607openalex-snapshot
Bounds for small-error and zero-error quantum algorithms
inferred← citeshttps://doi.org/10.1137/0217031openalex-snapshot
Monotone Bipartite Graph Properties are Evasive
inferred← citeshttps://doi.org/10.1137/0220062openalex-snapshot
CREW PRAM s and Decision Trees
inferred← citeshttps://doi.org/10.1137/120888703openalex-snapshot
A Lower Bound for the Complexity of Monotone Graph Properties
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/s0097539700382005openalex-snapshot
Evasiveness of Subgraph Containment and Related Properties
inferred← citeshttps://doi.org/10.1137/s0097539703426799openalex-snapshot
Perfectness is an Elusive Graph Property
inferred← citeshttps://doi.org/10.1137/s009753979119415xopenalex-snapshot
Some Results on Elusive Graph Properties
inferred← citeshttps://doi.org/10.1137/s0895480100366968openalex-snapshot
Complexes of t -Colorable Graphs
inferred← citeshttps://doi.org/10.1137/s0895480198343819openalex-snapshot
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
inferred← citeshttps://doi.org/10.1145/1566374.1566379openalex-snapshot
A new perspective on implementation by voting trees
inferred← citeshttps://doi.org/10.1145/2422436.2422454openalex-snapshot
Evasiveness through a circuit lens
inferred← citeshttps://doi.org/10.1145/248052.248112openalex-snapshot
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
inferred← citeshttps://doi.org/10.1145/2527748.2527763openalex-snapshot
Gems in decision tree complexity revisited
inferred← citeshttps://doi.org/10.1145/2591708.2591736openalex-snapshot
A method to prove query lower bounds
inferred← citeshttps://doi.org/10.1145/2688073.2688085openalex-snapshot
Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive
inferred← citeshttps://doi.org/10.1145/2935764.2935799openalex-snapshot
Shuffles and Circuits
inferred← citeshttps://doi.org/10.1145/3232536openalex-snapshot
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
inferred← citeshttps://doi.org/10.1145/3313908openalex-snapshot
Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive
inferred← citeshttps://doi.org/10.1145/3406325.3451002openalex-snapshot
Bipartite perfect matching as a real polynomial
inferred← citeshttps://doi.org/10.1145/3406325.3451047openalex-snapshot
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
inferred← citeshttps://doi.org/10.1145/3618260.3649632openalex-snapshot
Local Borsuk-Ulam, Stability, and Replicability
inferred← citeshttps://doi.org/10.1145/3618260.3649644openalex-snapshot
Counting Small Induced Subgraphs with Edge-Monotone Properties
inferred← citeshttps://doi.org/10.1145/62212.62258openalex-snapshot
Lower bounds on the complexity of graph properties
inferred← citeshttps://doi.org/10.1145/73007.73038openalex-snapshot
CREW PRAMS and decision trees
inferred← citeshttps://doi.org/10.1155/ijmms/2006/79858openalex-snapshot
Collapsing along monotone poset maps
inferred← citeshttps://doi.org/10.11575/cdm.v7i2.61908openalex-snapshot
Vertex decompositions of two-dimensional complexes and graphs
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.1609/aaai.v31i1.10702openalex-snapshot
Query Complexity of Tournament Solutions
inferred← citeshttps://doi.org/10.17169/refubium-13064openalex-snapshot
Methods from Differential Geometry in Polytope Theory
inferred← citeshttps://doi.org/10.37236/1900openalex-snapshot
Optimal Decision Trees on Simplicial Complexes
inferred← citeshttps://doi.org/10.37236/3319openalex-snapshot
Knots in Collapsible and Non-Collapsible Balls
inferred← citeshttps://doi.org/10.37236/69openalex-snapshot
Betti Numbers of Monomial Ideals and Shifted Skew Shapes
inferred← citeshttps://doi.org/10.37236/825openalex-snapshot
A Uniform Approach to Complexes arising from Forests
inferred← citeshttps://doi.org/10.3906/mat-1112-14openalex-snapshot
Threshold complexes and connections to number theory
inferred← citeshttps://doi.org/10.4213/im9489openalex-snapshot
634 vertex-transitive and more than $10^{103}$ non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane
inferred← citeshttps://doi.org/10.4213/im9489eopenalex-snapshot
634 vertex-transitive and more than $10^{103}$ non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.36openalex-snapshot
On the Pseudo-Deterministic Query Complexity of NP Search Problems
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.108openalex-snapshot
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
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.4230/lipics.stacs.2010.2445openalex-snapshot
Evasiveness and the Distribution of Prime Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1007.4019openalex-snapshot
Vertex decompositions of two-dimensional complexes and graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04471openalex-snapshot
Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes
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.1702.03606openalex-snapshot
Sphere geometry and invariants
inferred← citeshttps://doi.org/10.48550/arxiv.1703.10819openalex-snapshot
A note on graphs with disjoint maximal cliques ans a link with evasiveness
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01933openalex-snapshot
Random Uniform and Pure Random Simplicial Complexes
inferred← citeshttps://doi.org/10.48550/arxiv.2001.05820openalex-snapshot
Probabilistic values for simplicial complexes
inferred← citeshttps://doi.org/10.48550/arxiv.math/9705219openalex-snapshot
Complexes of not $i$-connected graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1766openalex-snapshot
The smallest nonevasive graph property
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.