✦ LIBER ✦

A Ramseyian theorem on products of trees

✍ Scribed by G.L. McColm

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 398 KB
Volume: 57
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(91)90006-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A theorem on products of matrices

✍ Marc Artzrouni 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A theorem on labelled trees and the limi

A theorem on labelled trees and the limits of its provability

✍ Helmut Pfeiffer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 785 KB

A theorem on integer flows on cartesian

A theorem on integer flows on cartesian products of graphs

✍ Wilfried Imrich; Riste Škrekovski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003

A generalization of Ramsey's theorem for

A generalization of Ramsey's theorem for regular trees

✍ Walter Deuber 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A generalization of a theorem of duchon

A generalization of a theorem of duchon on products of vector measures

✍ Charles Swartz 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 404 KB

On the crossing numbers of Cartesian pro

On the crossing numbers of Cartesian products with trees

✍ Drago Bokal 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho