Extremal numbers of cycles revisited

preprint2021arXivOpen access

Abstract

We give a simple geometric interpretation of an algebraic construction of Wenger that yields nn-vertex graphs with no cycle of length 44, 66 or 1010 and close to the maximum number of edges.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.