Evasiveness of subgraph containment and related properties

Amit Chakrabarti, Subhash Khot, Yaoyun Shi

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 ½n2 − 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.

Original languageEnglish (US)
Title of host publicationSTACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsAfonso Ferreira, Horst Reichel
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540416951
StatePublished - 2001
Event18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Germany
Duration: Feb 15 2001Feb 17 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001


  • Decision tree complexity
  • Evasiveness
  • Graph property testing
  • Monotone graph properties

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Evasiveness of subgraph containment and related properties'. Together they form a unique fingerprint.

Cite this