The asymptotic behaviour of lovász’ ϑ function for random graphs

Combinatorica volume 2, pages153–155(1982)Cite this article

Abstract

We show that for a random graph Lovász’ ϑ function is of order √n.

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]

    Z. Füredi andJ. Komlós, The eigenvalues of random symmetric matrices,Combinatorica 1 (1981) 233–241.

    MATH  MathSciNet  Google Scholar 

  2. [2]

    F. Juhász, On the spectra of non-symmetric random (0,1) matrices,to appear in Discrete Mathematics.

  3. [3]

    L. Lovász, On the Shannon capacity of a graph,IEEE Transactions on Information Theory,25 (1979) 1–7.

    MATH  Article  Google Scholar 

Download references

Author information

Affiliations

  1. Hungarian Academy of Sciences Computer and Automation Institute, Úri u. 49, H-1014, Budapest, Hungary

    Ferenc Juhász

Authors
  1. Ferenc Juhász
    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

Juhász, F. The asymptotic behaviour of lovász’ ϑ function for random graphs. Combinatorica 2, 153–155 (1982). https://doi.org/10.1007/BF02579314

Download citation

AMS Subject classification (1980)

  • 05 C 50
  • 60 C 05