Dense graphs with cycle neighborhoods

Abstract

For all ε > 0, we construct graphs with n vertices and > n2 - ε edges, for arbitrarily large n, such that the neighborhood of each vertex is a cycle. This result is asymptotically best possible. © 1995 by Academic Press, Inc.