Skip to main content
SpringerLink
Log in

Regular subgraphs of dense graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Every graph onn vertices, with at leastc k n logn edges contains ak-regular subgraph. This answers a question of Erdős and Sauer.

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. N. Alon, S. Friedland andG. Kalai, Regular subgraphs of almost regular graphs,Journal of Combinatorial Theory (B) 37 (1984), 79–91.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Bollobás,Extremal Graph Theory, Academic Press, New York, 1978, Problem 20, 399.

    MATH  Google Scholar 

  3. J. A. Bondy andU. S. R. Murty,Graph Theory with Applications, Macmillan Press, London, 1976.

    Google Scholar 

  4. P. Erdős, On bipartite subgraphs of graphs (in Hungarian),Matematikai Lapok 18 (1967), 283–288.

    MathSciNet  Google Scholar 

  5. P. Erdős, On the Combinatorial Problems which I would most like to see solved,Combinatorica 1 (1981), 25–42.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, P. O. B. 127, 1364, Budapest, Hungary

    L. Pyber

Authors
  1. L. Pyber
    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

Pyber, L. Regular subgraphs of dense graphs. Combinatorica 5, 347–349 (1985). https://doi.org/10.1007/BF02579250

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation