Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant . 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/2n 2 - 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 . We prove a similar result for bipartite subgraph containment.
KeywordsDecision Tree Complexity Monotone Graph Properties Evasiveness Graph Property Testing
Unable to display preview. Download preview PDF.
- 1.Best, M. R., van Emde Boas, P., Lenstra, H. W., Jr. A sharpened version of the Aanderaa-Rosenberg Conjecture, Report ZW 30/74, Mathematisch Centrum Amsterdam, 1974.Google Scholar
- 3.Bollobás, B. Extremal Graph Theory, Academic Press, 1978, Chapter 8.Google Scholar
- 5.Milner, E. C., Welsh, D. J. A. On the computational complexity of graph theoretical properties, Proc. 5th British Columbia Conf. on Combinatorics (C. St. J. A. Nash-Williams and J. Sheehan, Eds.), 1975, 471–487.Google Scholar