Skip to main content
SpringerLink
Log in

A Ramsey-type problem in directed and bipartite graphs

  • 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

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. L. Gerencsér andA. Gyárfás, On Ramsey-type problems,Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 10 (1967), 167–170.

    Google Scholar 

  2. L. Rédei, Ein kombinatorischer Satz,Acta Sci. Math. (Szeged)7 (1934), 39–43.

    Google Scholar 

  3. T. Gallai, On directed paths and circuits,Theory of Graphs (Proc. Colloq., Tihany, 1966), New York, 1968, 115–118.

  4. H. Raynaud, Sur le circuit hamiltonien bi-coloré dans les graphes orientés,Period. Math. Hungar. 3 (1973), 289–297.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MTA Számítástechnikai Központja, Úri U. 49, H-1250, Budapest, Hungary

    A. Gyárfás & J. Lehel

Authors
  1. A. Gyárfás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Lehel
    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

Gyárfás, A., Lehel, J. A Ramsey-type problem in directed and bipartite graphs. Period Math Hung 3, 299–304 (1973). https://doi.org/10.1007/BF02018597

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation