Skip to main content
SpringerLink
Log in

Products of graphs and their applications

  • Conference paper
  • First Online:
Book cover Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1018))

Abstract

Products are conveniently used in many combinatorial applications. In various situations they present a suitable construction means. In this paper we survey some of those applications which are related (in a broad sense) to the partition (Ramsey) theory.

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

Access this chapter

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Burr, P. Erdös and L. Lovász, On Ramsey minimal graphs, Ars Combinatoria 1 (1976), 167–190.

    MathSciNet  MATH  Google Scholar 

  2. V. Chvátal, Hypergraphs and Ramseyaian theorems, Proc. Amer. Math. Soc. 27 (1971), 434–440.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press (1974).

    Google Scholar 

  4. R. Graham, B. Rothschild and J. Spencer, Ramsey Theory, John Wiley and Sons (1980).

    Google Scholar 

  5. L. Lovász, J. Nešetřil and A. Pultr, On a product dimension of a graph, J. Comb. Th. B, 29 (1980), 47–67.

    Article  MATH  Google Scholar 

  6. J. Nešetřil and A. Pultr, On classes of relations and graphs determined by subobjects and factorobjects, Discrete Math., 22 (1978), 287–300.

    Article  MathSciNet  MATH  Google Scholar 

  7. J. Mešetřil and V. Rödl, A simple proof of the Galvin-Ramsey property of graphs and a dimension of a graph, Discrete Math., 23 (1978), 49–55.

    Article  MathSciNet  Google Scholar 

  8. J. Nešetřil and V. Rödl, Partitions of vertices, Comment. Math. Univ. Carolinae, 17 (1976), 675–682.

    MathSciNet  MATH  Google Scholar 

  9. S. Poljak and V. Rödl, On arc-chromatic number of graphs, J. Comb. Th., B, (to appear).

    Google Scholar 

  10. S. Poljak and A. Pultr, Representing graphs by means of strong and weak products, Comment. Math. Univ. Carol., (to appear).

    Google Scholar 

  11. A. Pultr and J. Vinárek, Productive classes and subdirect irreducibility, in particular for graphs, Discrete Math., 20 (1977), 159–176.

    Article  MathSciNet  MATH  Google Scholar 

  12. N. Wheeler, On universal horn theories, J. Symb. Logic, 43 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KZAA MFF KU Charles University, Sokolovská 83, 186 00, Praha 8, Czech Republic

    Jaroslaw Nešetřil

  2. KM FJFI Czech Technical University, Husowa 5, 110 00, Praha 1, Czech Republic

    Vojtěch Rödl

Authors
  1. Jaroslaw Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vojtěch Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Borowiecki John W. Kennedy Maciej M. Sysło

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Nešetřil, J., Rödl, V. (1983). Products of graphs and their applications. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071625

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12687-4

  • Online ISBN: 978-3-540-38679-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation