Article PDF
Avoid common mistakes on your manuscript.
References
C. Berge,Graphs and hypergraphs, North-Holland, Amsterdam, 1973.MR 50 # 9640
B. Bollobás, On generalized graphs,Acta Math. Acad. Sci. Hungar. 16 (1965), 447–452.MR 32 # 1133
G. Dirac, Short proof of Menger's graph theorem,Mathematika 13 (1966), 42–44.MR 33#3956
F. Harary,Graph theory, Addison-Wesley, Reading, 1969.MR 41 # 1566
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
G. Katona, Solution of a problem of A Ehrenfeucht and J. Mycielski,J. Combinatorial Theory Ser. A 17 (1974), 265–266.MR 49 # 8870
O. Ore,Theory of graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962.MR 27 # 740
Author information
Authors and Affiliations
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
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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02019432