Skip to main content
Log in

A Ramsey-type theorem and its application to relatives of Helly's theorem

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

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.

References

  1. A. A. Zykov, On some properties of linear complexes,Mat. Sb. 24 (66) (1949), 163–188 (in Russian).

    Google Scholar 

  2. A. Hajnal undJ. Surányi, Über die Auflösung von Graphen in vollständige Teilgraphen,Ann. Univ. Sci. Budapest. Fötvös Sect. Math. 1 (1958), 113–121.

    Google Scholar 

  3. F. P. Ramsey, On a problem of formal logic,Proc. London Math. Soc. (2)30 (1929–1930), 264–286.

    Google Scholar 

  4. L. W. Danzer, B. Grünbaum andV. Kiré, Helly's theorem and its relatives,Proc. Sympos. Pure Math., Vol. VII, Providence, 1963, 101–180.

  5. A. Gyárfás andJ. Lehel, A Helly-typi problem in trees,Combinatorial Theory and its Appl. (Colloq. Math. Soc. J. Bolyai4), Amsterdam-London, 1970, 571–584.

  6. C. G. Lekkerkerker andJ. C. Boland, Representation of a finite graph by a set of intervals on the real line,Fund. Math. 51 (1962–63), 45–64.

    Google Scholar 

  7. F. S. Roberts, On the boxicity and cubicity of a graph,Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, 1968), New York, 1969, 301–310.

  8. D. G. Bourgin, Restricted separation of polynedra,Protugaliae Math. 11 (1952), 133–136.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gyárfás, A. A Ramsey-type theorem and its application to relatives of Helly's theorem. Period Math Hung 3, 261–270 (1973). https://doi.org/10.1007/BF02018591

Download citation

  • Received:

  • Issue Date:

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

Navigation