Transitive graphs in counterexamples to Karp's conjecture
组合数学
2007-05-23 v1 代数拓扑
摘要
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.
引用
@article{arxiv.math/0512421,
title = {Transitive graphs in counterexamples to Karp's conjecture},
author = {Alexander Engström},
journal= {arXiv preprint arXiv:math/0512421},
year = {2007}
}
备注
18 pages