Transitive graphs in counterexamples to Karp's conjecture
classification
🧮 math.CO
math.AT
keywords
graphgraphskarptransitivecompleteconjectureconjecturedcontained
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.