×

Mengerian theorems for paths of bounded length. (English) Zbl 0393.05033


MSC:

05C38 Paths and cycles

Citations:

Zbl 0344.05137
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] C. Berge,Graphs and hypergraphs, North-Holland, Amsterdam, 1973.MR 50 # 9640
[2] B. Bollobás, On generalized graphs,Acta Math. Acad. Sci. Hungar. 16 (1965), 447–452.MR 32 # 1133 · Zbl 0138.19404 · doi:10.1007/BF01904851
[3] G. Dirac, Short proof of Menger’s graph theorem,Mathematika 13 (1966), 42–44.MR 33#3956 · Zbl 0144.45102 · doi:10.1112/S0025579300004162
[4] F. Harary,Graph theory, Addison-Wesley, Reading, 1969.MR 41 # 1566 · Zbl 0182.57702
[5] F. Jaeger andC. Payan, Nombre maximal d’arêtes d’un hypergraphe {\(\tau\)}-critique de rangh, C. R. Acad. Sci. Paris. Sér. A 273 (1971), 221–223.Zbl 234. 05119 · Zbl 0234.05119
[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 · Zbl 0289.05002 · doi:10.1016/0097-3165(74)90018-1
[7] O. Ore,Theory of graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962.MR 27 # 740 · Zbl 0105.35401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.