Skip to main content
Log in

Ramsey graphs contain many distinct induced subgraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

It is shown that any graph onn vertices containing no clique and no independent set ont + 1 vertices has at least

$$2^{{n \mathord{\left/ {\vphantom {n {(2t^{20 \log (2t)} )}}} \right. \kern-\nulldelimiterspace} {(2t^{20 \log (2t)} )}}} $$

distinct induced subgraphs.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alon, N.: Ramsey graphs cannot be defined by real polynomials. J. Graph Theory, in press.

  2. Alon, N., Bollobás, B.: Graphs with a small number of distinct induced subgraphs. Discrete Math.75, 23–30 (1989)

    Google Scholar 

  3. Erdös, P.: Some remarks on the theory of graphs. Bull. Am. Math. Soc.53, 292–294 (1947)

    Google Scholar 

  4. Erdös, P., Hajnal, A.: Ramsey type theorems. Discrete Applied Math.25, 37–52 (1989)

    Google Scholar 

  5. Erdös, P., Hajnal, A.: On the number of distinct induced subgraphs of a graph. Discrete Math.75, 145–154 (1989)

    Google Scholar 

  6. Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. New York: Wiley Interscience 1980

    Google Scholar 

  7. Rödl, V.: Private communication

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Hajnal, A. Ramsey graphs contain many distinct induced subgraphs. Graphs and Combinatorics 7, 1–6 (1991). https://doi.org/10.1007/BF01789457

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation