Sparse ramsey graphs

Abstract

IfH is a Ramsey graph for a graphG thenH is rich in copies of the graphG. Here we prove theorems in the opposite direction. We find examples ofH such that copies ofG do not form short cycles inH. This provides a strenghtening also, of the following well-known result of Erdős: there exist graphs with high chromatic number and no short cycles. In particular, we solve a problem of J. Spencer.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    P. Erdős andA. Hajnal, On chromatic number of graphs and set systems,Acta Math. Acad. Sci. Hung. 17 (1966), 61–99.

    Article  Google Scholar 

  2. [2]

    J. Folkman, Graphs with monochromatic complete subgraphs in every edge coloring,SIAM J. Appl. Math. 18 (1970), 19–29.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    L. Lovász, On chromatic number of finite set-systems,Acta Math. Acad. Sci. Hungar. 19 (1968), 59–67.

    MATH  Article  MathSciNet  Google Scholar 

  4. [4]

    J. Nešetřil andV. Rödl, Ramsey property of graphs with forbidden complete subgraphs,J. Comb. Th. (B) 20 (1976), 243–249.

    Article  Google Scholar 

  5. [5]

    J. Nešetřil andV. Rödl, A short proof of the existence of highly chromatic hypergraphs without short cycles,J. Comb. Th. (B) 27 (1979), 225–227.

    Article  Google Scholar 

  6. [6]

    J. Nešetřil andV. Rödl, Simple proof of the existence of restricted Ramsey graphs by means of a partite construction,Combinatorica 1 (1982), 199–202.

    Google Scholar 

  7. [7]

    J. Nešetřil andV. Rödl,to appear.

Download references

Author information

Affiliations

Authors

Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nešetřil, J., Rödl, V. Sparse ramsey graphs. Combinatorica 4, 71–78 (1984). https://doi.org/10.1007/BF02579159

Download citation

AMS subject classification (1980)

  • 05 C 55
  • 05 C 38
  • 05 C 65