On the number of edges of quadrilateral-free graphs

79Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

If a graph has q2 + q + 1 vertices (q > 13), e edges and no 4-cycles then e ≤ 1/2q(q + 1)2. Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdos from the 1930's. © 1996 Academic Press, Inc.

Cite

CITATION STYLE

APA

Füredi, Z. (1996). On the number of edges of quadrilateral-free graphs. Journal of Combinatorial Theory. Series B, 68(1), 1–6. https://doi.org/10.1006/jctb.1996.0052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free