[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Asymptotic solution of the Turán problem for some hypergraphs

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Taking an ordinary graphL 2 and replacing each of its vertices by a group ofr/2 vertices (r is even), we get anr-uniform hypergraphL′. In the casex(L 2)=2m+1, we solve asymptotically the Turán problem forL′. Ifx(L 2)#2m+1, the upper bound is still valid but proper constructions are not known.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Frankl, P.: Asymptotic solution of a Turán-type problem. Graphs and Combinatorics6, 223–227 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Erdös, P., Simonovits, M.: A limit theorem on graph theory. Studia Sci. Math. Hungar.1, 51–57 (1966)

    MathSciNet  Google Scholar 

  3. Katona, G., Nemetz, T., Simonovits, M.: On a graph problem of Turán (in Hungarian). Mat. Lapok15, 228–238 (1964)

    MathSciNet  Google Scholar 

  4. Sidorenko, A.F.: Extremal combinatorial problems for spaces with continuous measure (in Russian). In: Issledovanie Operatciy i ASU, Vol. 34, pp 34–40. Kiev: Vischa Shkola 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, 251 Mercer St., 10012, New York, NY, USA

    Alexander Sidorenko

Authors
  1. Alexander Sidorenko
    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

Sidorenko, A. Asymptotic solution of the Turán problem for some hypergraphs. Graphs and Combinatorics 8, 199–201 (1992). https://doi.org/10.1007/BF02350635

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02350635

Keywords

Search

Navigation