A class of constructions for turán’s (3, 4)-problem

Combinatorica volume 2, pages187–192(1982)Cite this article

Abstract

Letf(n) denote the minimal number of edges of a 3-uniform hypergraphG=(V, E) onn vertices such that for every quadrupleY ⊂V there existsY ⊃e ∈E. Turán conjectured thatf(3k)=k(k−1)(2k−1). We prove that if Turán’s conjecture is correct then there exist at least 2k−2 non-isomorphic extremal hypergraphs on 3k vertices.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. [1]

    W. G. Brown, On an open problem of Paul Turán concerning 3-graphs,Studies in Pure Mathematics (to appear).

  2. [2]

    P. Turán, Research problems,Magyar Tud. Akad. Mat. Kut. Int. Közl. 6 (1961), 417–423.

    Google Scholar 

Download references

Author information

Affiliations

  1. Institute of Mathematics of the Siberian Branch of the Academy of Sciences of the USSR, 630090, Novosibirsk-90, USSR

    A. V. Kostochka

Authors
  1. A. V. Kostochka
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kostochka, A.V. A class of constructions for turán’s (3, 4)-problem. Combinatorica 2, 187–192 (1982). https://doi.org/10.1007/BF02579317

Download citation

AMS subject classification (1980)

  • 05 C 35
  • 05 C 65