Skip to main content
Log in

Mengerian theorems for paths of bounded length

  • 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. C. Berge,Graphs and hypergraphs, North-Holland, Amsterdam, 1973.MR 50 # 9640

    Google Scholar 

  2. B. Bollobás, On generalized graphs,Acta Math. Acad. Sci. Hungar. 16 (1965), 447–452.MR 32 # 1133

    Article  Google Scholar 

  3. G. Dirac, Short proof of Menger's graph theorem,Mathematika 13 (1966), 42–44.MR 33#3956

    Google Scholar 

  4. F. Harary,Graph theory, Addison-Wesley, Reading, 1969.MR 41 # 1566

    Google Scholar 

  5. F. Jaeger andC. Payan, Nombre maximal d'arêtes d'un hypergraphe τ-critique de rangh, C. R. Acad. Sci. Paris. Sér. A 273 (1971), 221–223.Zbl 234. 05119

    Google Scholar 

  6. G. Katona, Solution of a problem of A Ehrenfeucht and J. Mycielski,J. Combinatorial Theory Ser. A 17 (1974), 265–266.MR 49 # 8870

    Article  Google Scholar 

  7. O. Ore,Theory of graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962.MR 27 # 740

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to the memory ofFernando Escalante

Research supported in part by CIMAS (The University of Mexico), IREX and The Hungarian Academy of Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lovász, L., Neumann-Lara, V. & Plummer, M. Mengerian theorems for paths of bounded length. Period Math Hung 9, 269–276 (1978). https://doi.org/10.1007/BF02019432

Download citation

  • Received:

  • Issue Date:

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

AMS (MOS) subject classifications (1970)

Key words and phrases

Navigation