Abstract
A graph property is a set of graphs such that if the set contains some graphG then it also contains each isomorphic copy ofG (with the same vertex set). A graph propertyP onn vertices is said to be elusive, if every decision tree algorithm recognizingP must examine alln(n−1)/2, pairs of vertices in the worst case. Karp conjectured that every nontrivial monotone graph property is elusive. In this paper, this conjecture is proved for some cases. Especially, it is shown that if the abstract simplicial complex of a nontrivial monotone graph propertyP has dimension not exceeding 5, thenP is elusive.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
