𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets

✍ Scribed by Philip L. Bowers

Publisher
Springer Japan
Year
1990
Tongue
English
Weight
1023 KB
Volume
6
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A graph-theoretic version of the union-c
A graph-theoretic version of the union-closed sets conjecture
✍ El-Zahar, Mohamed H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture

A simple proof of the Galvin-Ramsey prop
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
✍ Jaroslav NeΕ‘etΕ™il; VojtΔ›ch Rōdl πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 845 KB

Using a representation of finite graphs by direct products we prove the theorem given in the title in a very simple way. Moreover, we introduce a dimension of a graph analogous to the Dushnik-Miller dimension of a partially ordered se:.