Transitive graphs in counterexamples to Karp's conjecture

Simple item page
dc.creatorEngström, Alexander
dc.date2005-12-17
dc.date.accessioned2026-07-07T06:55:28Z
dc.date.available2026-07-07T06:55:28Z
dc.descriptionKarp 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.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0512421
dc.identifierhttp://arxiv.org/abs/math/0512421
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106290
dc.subjectCombinatorics
dc.subjectAlgebraic Topology
dc.subject05C15, 57M15
dc.titleTransitive graphs in counterexamples to Karp's conjecture
dc.typetext

Files

Collections

arXiv