Exhibiting an adversary to prove a boolean function is evasive

Question

I'm trying to collect examples of exhibiting an adversary to prove that a Boolean function is evasive. I know of several examples of graph properties for which adversary methods have been used, i.e. graph connectedness and containing a triangle, however I'm hoping to find other interesting examples.