# Lecture Notes on Evasiveness of Graph Properties

@article{Lovsz2002LectureNO, title={Lecture Notes on Evasiveness of Graph Properties}, author={L{\'a}szl{\'o} Lov{\'a}sz and Neal E. Young}, journal={ArXiv}, year={2002}, volume={cs.CC/0205031} }

This report presents notes from the first eight lectures of the class Many Models of Complexity taught by Laszlo Lovasz at Princeton University in the fall of 1990. The topic is evasiveness of graph properties: given a graph property, how many edges of the graph an algorithm must check in the worst case before it knows whether the property holds.

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 26 CITATIONS

## A note on graphs with disjoint maximal cliques ans a link with evasiveness

VIEW 2 EXCERPTS

CITES BACKGROUND

## C O ] 3 1 M ar 2 01 7 A note on graphs with disjoint cliques and a link with evasiveness

VIEW 2 EXCERPTS

CITES BACKGROUND

## A Communication Game Related to the Sensitivity Conjecture

VIEW 1 EXCERPT

CITES BACKGROUND

## A New Approach to the Sensitivity Conjecture

VIEW 1 EXCERPT

CITES BACKGROUND