Transitive graphs in counterexamples to Karp's conjecture
Abstract
Description
Karp conjectured that all nontrivial monotone graph properties are evasive. This was proved for n a prime power, and n=6, where n is the number of graph vertices, by Kahn, Saks, and Sturtevant. We give a complete description of which transitive graphs are contained in a possible counterexample when n=10.
18 pages
18 pages