✦ LIBER ✦

Monotone paths in ordered graphs

✍ Scribed by Vladimír Müller; Vojtěch Rödl

Book ID: 110564365
Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 423 KB
Volume: 2
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579318

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Increasing paths in edge ordered graphs

✍ R. L. Graham; D. J. Kleitman 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 339 KB

A note on monotone paths in labeled grap

A note on monotone paths in labeled graphs

✍ Jan Reiterman 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 81 KB

Large Monotone Paths in Graphs with Boun

Large Monotone Paths in Graphs with Bounded Degree

✍ Raphael Yuster 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 109 KB

Hamilton paths in vertex-transitive grap

Hamilton paths in vertex-transitive graphs of order

✍ Klavdija Kutnar; Dragan Marušič; Cui Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Long Monotone Paths in Line Arrangements

✍ József Balogh; Oded Regev; Clifford Smyth; William Steiger; Mario Szegedy 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 178 KB

Increasing sequences with nonzero block

Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs

✍ 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