Skip to main content
SpringerLink
Log in

On generalized ramsey numbers for trees

  • Published:
Combinatorica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R. C. Bose, I. M. Chakravarti andE. Knuth, On methods of constructing sets of mutually orthogonal latin squares using a computer I,Technometrics 2, (1960) 507–516.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. E. Brouwer andA. Schrijver, The blocking number of an affine space,Journal Comb. Theory A 24, (1978) 251–253.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. A. Burr andJ. A. Roberts, On Ramsey numbers for stars, Util. Math. 4, 217–220 (1973).

    MATH  MathSciNet  Google Scholar 

  4. J. Dénes andA. Keedwell,Latin squares and their applications, English Universities Press, London 1974.

    MATH  Google Scholar 

  5. A. L. Dulmage, D. M. Johnson andN. S. Mendelsohn, Orthomorphisms of groups and orthogonal latin squares I,Canad. J. Math. 13, (1961) 356–372.

    MATH  MathSciNet  Google Scholar 

  6. P. Erdős andR. L. Graham, On partition theorems for finite graphs,Colloq. Math. Soc. János Bolyai,10,Infinite and Finite Sets, Keszthely, Hungary, 1973, 515–527.

    Google Scholar 

  7. R. L. Graham,Rudiments of Ramsey Theory, Regional conf. series in Math.45, Amer. Math. Soc., Providence, 1981.

    MATH  Google Scholar 

  8. K. Heinrich, Disjoint quasigroups,Proc. London Math. Soc. III. Ser. 45, (1982) 547–563.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. W. Irving, Generalized Ramsey numbers for small graphs,Discr. Math. 9, (1974) 251–264.

    Article  MATH  MathSciNet  Google Scholar 

  10. B. Lindström, Undecided Ramsey numbers for paths,Discr. Math. 43, (1983) 111–112.

    MATH  Google Scholar 

  11. D. K. Ray-Chaudhury andR. M. Wilson, Solution of Kirkman’s schoolgirl problem,Combinatorics, AMS Proc. Symp. Pure Math. 19, (1971) 187–203.

    Google Scholar 

  12. D. K. Ray-Chaudhury andR. M. Wilson, The existence of resolvable block designs,A Survey of Combinatorial Theory (ed. J. N. Srivastava), North-Holland, Amsterdam, 1973, 361–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität Heidelberg, Im Neuenheimer Feld 288, 69, Heidelberg, Germany

    Jürgen Bierbrauer & Albrecht Brandis

Authors
  1. Jürgen Bierbrauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albrecht Brandis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bierbrauer, J., Brandis, A. On generalized ramsey numbers for trees. Combinatorica 5, 95–107 (1985). https://doi.org/10.1007/BF02579372

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation