Evasiveness of Subgraph Containment and Related Properties

Authors:
Amit Chakrabarti;Subhash Khot;Yaoyun Shi
Affiliations:
-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 4
Cited 0

Monotone bipartite graph properties are evasive

SIAM Journal on Computing
Some Results on Elusive Graph Properties

SIAM Journal on Computing
On the time required to recognize properties of graphs: a problem

ACM SIGACT News
Extremal Graph Theory

Extremal Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant [4]. For the property of containing a subgraph isomorphic to a fixed graph, and a fairly large class of related n-vertex graph properties, we show evasiveness for an arithmetic progression of values of n. This implies a 1/2n2 - O(n) lower bound on the decision tree complexity of these properties. We prove that properties that are preserved under taking graph minors are evasive for all sufficiently large n. This greatly generalizes the evasiveness result for planarity [1]. We prove a similar result for bipartite subgraph containment.