On the public citation graph

Monotone Bipartite Graph Properties are Evasive

0 signed · 51 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/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1016/b978-0-08-016160-0.50028-2openalex-snapshot
ELEMENTS OF ALGEBRAIC TOPOLOGY
inferredcites →https://doi.org/10.1145/1008299.1008302openalex-snapshot
On the time required to recognize properties of graphs

What points at this work

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

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/rsa.20164openalex-snapshot
Improved lower bounds on the randomized complexity of graph properties
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-48523-6_26openalex-snapshot
Space-Time Tradeoffs for Graph Properties
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_80openalex-snapshot
Tight bounds for finding degrees from the adjacency matrix
inferred← citeshttps://doi.org/10.1007/978-3-032-41160-0_20openalex-snapshot
Quantitative Monitoring of Semantic Regular Expressions with Oracle-Defined Trace Predicates
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-16988-5_7openalex-snapshot
k + Decision Trees
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/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/bf02669693openalex-snapshot
On the elusiveness of Hamiltonian property
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/s00493-010-2485-3openalex-snapshot
An asymptotic bound for the complexity of monotone graph properties
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/s11856-023-2505-9openalex-snapshot
Bipartite perfect matching as a real polynomial
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/50036-1openalex-snapshot
10.1016/b978-044488002-4/50036-1
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.1090/pcms/013/09openalex-snapshot
Poset topology: Tools and applications
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/sffcs.1999.814607openalex-snapshot
Bounds for small-error and zero-error quantum algorithms
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.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.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.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.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/3530800.3534538openalex-snapshot
Worst-case analysis for interactive evaluation of Boolean provenance
inferred← citeshttps://doi.org/10.1145/3707208openalex-snapshot
Faster Matroid Partition Algorithms
inferred← citeshttps://doi.org/10.11606/d.45.1992.tde-20210729-003347openalex-snapshot
Complexidade aleatoria de problemas computacionais
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.ccc.2021.36openalex-snapshot
On the Pseudo-Deterministic Query Complexity of NP Search Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2717openalex-snapshot
Chio Condensation and Random Sign Matrices
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.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.