One of the classical applications of topological methods in combinatorics is the proof of the so-called Evasiveness Conjecture for graphs whose number of vertices is a prime power. In this chapter we describe the framework of the problem, sketch the original argument, and prove some important facts about nonevasiveness. One of the important tools is the so-called closure operators, which are also useful in other contexts.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Evasiveness and Closure Operators. In: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71962-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-71962-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71961-8
Online ISBN: 978-3-540-71962-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)