Note: The Smallest Nonevasive Graph Property
Michał Adamaszek
Discussiones Mathematicae Graph Theory, Tome 34 (2014), p. 857-862 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that it is essentially the unique such with n ≤ 5.

Publié le : 2014-01-01
EUDML-ID : urn:eudml:doc:269823 
@article{bwmeta1.element.doi-10_7151_dmgt_1766,
     author = {Micha\l\ Adamaszek},
     title = {Note: The Smallest Nonevasive Graph Property},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {34},
     year = {2014},
     pages = {857-862},
     zbl = {1303.05126},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1766}
}

Michał Adamaszek. Note: The Smallest Nonevasive Graph Property. Discussiones Mathematicae Graph Theory, Tome 34 (2014) pp. 857-862. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1766/

[1] M.R. Best, P. van Emde Boas and H.W. Lenstra, A sharpened version of the Aanderaa-Rosenberg conjecture, Afd. Zuivere Wisk. 30/74 (1974). | Zbl 0294.05125

[2] C.E. Chronaki, A survey of evasivness: lower bounds on decision-tree complexity of Boolean functions, The University of Rochester Tech. Report (1990), available from www.ics.forth.gr/~chronaki/papers/ur/eve.ps.

[3] J. Kahn, M. Saks and D. Sturtevant, A topological approach to evasiveness, Com- binatorica 4 (1984) 249-315. doi:10.1007/BF02579140

[4] D. Kozlov, Combinatorial Algebraic Topology (Algorithms and Computation in Mathematics, Vol. 21, Springer-Verlag Berlin Heidelberg, 2008).

[5] M. de Longueville, A Course in Topological Combinatorics (Universitext, Springer New York, 2013). | Zbl 1273.05001

[6] L. Lovász and N. Young, Lecture Notes on Evasiveness of Graph Properties, Tech. Rep. CS-TR-317-91, Computer Science Dept., Princeton University, available from arxiv/0205031.

[7] E.C. Milner and D.J.A. Welsh, On the computational complexity of graph theoretical properties, Proc. 5th British Comb. Conf. Aberdeen 1975 (1976) 471-487.

[8] The On-Line Encyclopedia of Integer Sequences, published electronically at oeis.org.

[9] V. Welker, Constructions preserving evasiveness and collapsibility, Discrete Math. 207 (1999) 243-255. doi:10.1016/S0012-365X(99)00049-7 | Zbl 0938.06003