#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Shlomo Hoory, Nathan Linial, Avi Wigderson, Ran Gilad-Bachrach, Danny Harnik, Boaz Barak +15 others
- 2006

A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in numerous and often surprising contexts in both fields. But, perhaps, we should start with a few words about graphs in general. They are, of course, one of the… (More)

Two sets are non-crossing if they are disjoint or one contains the other. The non-crossing graph NC n is the graph whose vertex set is the set of nonempty subsets of [n] = {1,. .. , n} with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence… (More)

- ‹
- 1
- ›