Skip to main content
SpringerLink
Log in

A Sparse Gallai-Witt Theorem

  • Chapter
Topics in Combinatorics and Graph Theory

Abstract

Generalizing a result of the authors (Trans. Am. Math. Soc. 309,113–137, 1988) and simplifying the proof thereof a sparse Gallai-Witt theorem is proved.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Descartes, B. (1948): A three color problem. Eureka

    Google Scholar 

  • Erdös, P. (1959): Graph theory and probability. Can. J. Math. 11, 34–38

    Article  MATH  Google Scholar 

  • Lovâsz, L. (1968): On the chromatic number of finite set-systems. Acta Math. Acad. Sci. Hung. 19, 59–67

    Google Scholar 

  • Mycielski, J. (1955): Sur le coloriage des graphes. Colloq. Math. 3, 161–162 Nesetiil, J., Rödl, V. (1979): A short proof of the existence of highly chromatic

    Google Scholar 

  • hypergraphs without shortcycles J. Comb. Theory, Ser. B 27, 225–227 Prömel, H.J., Voigt, B. (1986): Ramsey theorems for finite graphs. To appear, cf.

    Google Scholar 

  • Report No. 86447-OR, Institut für Operations Research, Universität Bonn

    Google Scholar 

  • Prömel,H.J.,Voigt, B. (1988): A sparse Graham-Rothschild theorem.Trans. Am. Math. Soc.309,113–137

    Article  MATH  Google Scholar 

  • Rado, R. (1933): Studien zur Kombinatorik. Math. Z. 36, 424–480

    Article  MathSciNet  MATH  Google Scholar 

  • Spencer, J. (1975): Restricted Ramsey configurations. J. Comb. Theory, Ser. A 19, 278–286

    Article  MATH  Google Scholar 

  • van der Waerden, B.L. (1927): Beweis einer Baudetschen Vermutung. Nieuw Arch. Wiskd. 15, 212–216

    Google Scholar 

  • Witt, E. (1951): Ein kombinatorischer Satz der Elementargeometrie. Math. Nachr. 6, 261–262

    Article  MathSciNet  Google Scholar 

  • Zykov, A.A. (1949): On some properties of linear complexes. Mat. Sb., Nov. Ser. 24, 163–188 (In Russian; English translation: Transi., II. Ser., Am. Math. Soc. 79 (1952))

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bonn, Germany

    H.-J. Prömel & B. Voigt

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

    You can also search for this author in PubMed Google Scholar

  2. B. Voigt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik und ihre Didaktik, Pädagogische Hochschule Kiel, Olshausenstraße 75, 2300, Kiel, Germany

    Rainer Bodendiek

  2. Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Rechenzentrum, Zirkel 2, Postfach 6980, 7500, Karlsruhe, Germany

    Rudolf Henn

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Physica-Verlag Heidelberg

About this chapter

Cite this chapter

Prömel, HJ., Voigt, B. (1990). A Sparse Gallai-Witt Theorem. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46908-4_84

  • Publisher Name: Physica-Verlag HD

  • Print ISBN: 978-3-642-46910-7

  • Online ISBN: 978-3-642-46908-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation