Skip to main content
SpringerLink
Log in
Book cover

Irregularities of Partitions pp 39–46Cite as

A Few Remarks on Orientation of Graphs and Ramsey Theory

  • Chapter

Part of the book series: Algorithms and Combinatorics 8 ((AC,volume 8))

Abstract

Let D denote a class of digraph such that every induced digraph in D is in D again. Then either D contains all acyclic digraphs or almost no graph has an orientation in D. Proofs and variations on this theme are discussed. Some open problems in Ramsey theory are raised.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Infinite and Finite Sets, Coll. Math. Soc. János Bolyai 10 (Keszthely 1973), Budapest 1976.

    Google Scholar 

  2. Combinatorics, Coll. Math. Soc. János Bolyai 18 (Keszthely 1976), North Holland Pub. Co., 1978.

    Google Scholar 

  3. V. Bienia, H. Meyniel, Séminaire du Lundi, MSH, Paris, 1984.

    Google Scholar 

  4. B. Bollobás, Geodesies in oriented graphs, Ann. Disc. Math. 20 (1984) 76–73.

    Google Scholar 

  5. W. Deuber, Generalizations of Ramsey’s theorem, in Infinite and Finite Sets, Coll. Math. Soc. János Bolyai 10 (Keszthely 1973), Budapest 1976 ([1]) 323–332.

    Google Scholar 

  6. P. Erdős, A. Hajnal, L. Pósa, Strong embeddings of graphs into colored graphs, in Infinite and Finite Sets, Coll. Math. Soc. János Bolyai 10 (Keszthely 1973), Budapest 1976. ([1]) 585–595.

    Google Scholar 

  7. R. L. Graham, B.L. Rothschild, Some recent developments in Ramsey theory: in Combinatorics, M. Hall Jr. and J.H. Van Lint eds., D. Reidel Publ. Co., Dordrecht-Boston 1975, 261–276.

    Google Scholar 

  8. J. Nešetřil, V. Rödl, Partition (Ramsey) Theory — A survey, in Combinatorics, Coll. Math. Soc. János Bolyai 18 (Keszthely 1976), North Holland Pub. Co., 1978. ([2]) 759–792.

    Google Scholar 

  9. J. Nešetřil, V. Rödl, Partitions of finite relational and set systems, J. Comb. Th. (A), 22 (1977) 289–312.

    Article  MATH  Google Scholar 

  10. J. Nešetřil, V. Rödl, A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph, Disc. Math. 23 (1978) 49–55.

    Article  MATH  Google Scholar 

  11. J. Nešetřil, V. Rödl, Extensions of full Ramsey theorem in the categories of all graphs and the categories of relations, Pamphlet 2, 1974 (mimeo Charles Univ., Praha).

    Google Scholar 

  12. J. Nešetřil, V. Röd1, On a probabilistic graph-theoretical method, Proc. Amer. Math. Soc. 72 (1978) 417–421.

    MathSciNet  MATH  Google Scholar 

  13. J. Nešetřil, V. Rödl, Combinatorial partitions of finite posets and lattices — Ramsey lattices Alg. Univ. 19 (1984) 106–119.

    Article  Google Scholar 

  14. V. Rödl, A generalization of Ramsey theorem, in: Graphs, Hypergraphs and Block Systems (Zielona Gora 1976) 211–220.

    Google Scholar 

  15. V. Rödl, Dimension of a graph and a generalization of Ramsey theorem (Czech), Thesis, Charles Univ., Praha (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. E.P.L., Lausanne, Switzerland

    M. Cochand

  2. C.N.R.S., Paris, France

    P. Duchet

Authors
  1. M. Cochand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Duchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Analysis, Eötvös Loránd University, Múzeum krt. 6–8, H-1088, Budapest VIII, Hungary

    Gábor Halász

  2. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda u. 13–15, H-1053, Budapest V, Hungary

    Vera T. Sós

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cochand, M., Duchet, P. (1989). A Few Remarks on Orientation of Graphs and Ramsey Theory. In: Halász, G., Sós, V.T. (eds) Irregularities of Partitions. Algorithms and Combinatorics 8, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61324-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-61324-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50582-2

  • Online ISBN: 978-3-642-61324-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation