Skip to main content
SpringerLink
Log in

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

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    MATH  MathSciNet  Google Scholar 

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

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and 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

  • Received:

  • Issue Date:

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

AMS Subject classification (1980)

Search

Navigation