The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane

60Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, where c is a suitable absolute constant, must contain a copy of the Fano configuration (the projective plane of order two). This is an asymptotically sharp estimate. © 2000 Academic Press.

Cite

CITATION STYLE

APA

De Caen, D., & Füredi, Z. (2000). The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. Journal of Combinatorial Theory. Series B, 78(2), 274–276. https://doi.org/10.1006/jctb.1999.1938

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