𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Increasing paths in edge ordered graphs

✍ Scribed by R. L. Graham; D. J. Kleitman


Book ID
105437426
Publisher
Springer Netherlands
Year
1973
Tongue
English
Weight
339 KB
Volume
3
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Increasing sequences with nonzero block
✍ A.R. Calderbank; F.R.K. Chung; D.G. Sturtevant πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 622 KB

Consider the maximum length [(k) of a flexicographieally) increasing sequence of vectors in GF(2) k with the property that the sum of the vectors in any consecutive subsequence is nonzero modulo 2. We prove that ~. 2 k ~<f(k)~<(~+o(1))2 k. A related problem is the following. Suppose the edges of th

Monotone paths in ordered graphs
✍ VladimΓ­r MΓΌller; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1982 πŸ› Springer-Verlag 🌐 English βš– 423 KB
Paths in k-edge-connected graphs
✍ Haruko Okamura πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 562 KB