An extension of the Komlós subsequence theorem
✍ Scribed by I. Berkes
- Publisher
- Akadmiai Kiad
- Year
- 1990
- Tongue
- English
- Weight
- 387 KB
- Volume
- 55
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G = (V (G), E(G)) be a simple graph of maximum degree ∆ ≤ D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) ∪ E(G) such that no adjacent or incident elements of S receive
In his famous 1965 paper, Asher Wagner proves that if S is a finite affine plane and G a collineation group line transitive on S. then S is a translation atfine plane and G contains the translation group of S. In this paper, we generalize Wagner's assumptions to: S is an affine spfce embedded as a m