An extension of the pairing theorem
โ Scribed by Peter Karadakov
- Publisher
- John Wiley and Sons
- Year
- 1985
- Tongue
- English
- Weight
- 426 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0020-7608
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