Skip to main content
SpringerLink
Log in

The asymptotic number of graphs not containing a fixed color-critical subgraph

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

For a finite graphG letForb(H) denote the class of all finite graphs which do not containH as a (weak) subgraph. In this paper we characterize the class of those graphsH which have the property that almost all graphs inForb(H) are ℓ-colorable. We show that this class corresponds exactly to the class of graphs whose extremal graph is the Turán-graphT n (ℓ).An earlier result of Simonovits (Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions,Discrete Math. 7 (1974), 349–376) shows that these are exactly the (ℓ+1)-chromatic graphs which contain a color-critical edge.

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. B. Bollobás:Extremal graph theory, Academic Press, New York, 1978.

    Google Scholar 

  2. B. Bollobás, andP. Erdős: On the structure of edge graphs,Bull. London Math. Soc. 5 (1973), 317–321.

    Google Scholar 

  3. P. Erdős: Private Communication, Oberwolfach, June 1988.

  4. P. Erdős, D. J. Kleitman, andB. L. Rothschild: Asymptotic enumeration ofK n -free graphs.International Colloquium on Combinatorial Theory. Atti dei Convegni Lincei 17, Vol. 2, Rome, 1976, 19–27.

    Google Scholar 

  5. Ph. G. Kolaitis, H. J. Prömel, andB. L. Rothschild:K ℓ+1-free graphs: asymptotic structure and a 0–1 law;Trans. Amer. Math. Soc. 303 (1987), 637–671.

    Google Scholar 

  6. D. J. Kleitman, andB. L. Rothschild: Asymptotic enumeration of partial orders on a finite set,Trans. Amer. Math. Soc. 205 (1975), 205–220.

    Google Scholar 

  7. H. J. Prömel: Almost bipartite-making graphs, in: Random graphs '87 (M. Karonski, J. Jaworski, A. Ruciński, eds.), (1990), 275–282.

  8. H. J. Prömel, andA. Steger: Random ℓ-colorable graphs, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, 1992.

  9. M. Simonovits: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions,Discrete Mathematics 7 (1974), 349–376.

    Google Scholar 

  10. P. Turán: On an extremal problem in graph theory (in Hungarian),Mat. Fiz. Lapok 48 (1941), 436–452.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Diskrete Mathematik, Universität Bonn, D-5300, Bonn, Germany

    H. J. Prömel & A. Steger

Authors
  1. H. J. Prömel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Steger
    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

Prömel, H.J., Steger, A. The asymptotic number of graphs not containing a fixed color-critical subgraph. Combinatorica 12, 463–473 (1992). https://doi.org/10.1007/BF01305238

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification code (1991)

Search

Navigation