An Abstract Generalization of a Map Reduction Theorem of Birkhoff
✍ Scribed by M. Stiebitz; B. Toft
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 827 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A theorem of Kneser states that in an abelian group G; if A and B are finite subsets in G and AB ¼ fab : a 2 A; b 2 Bg; then jABj5jAj þ jBj À jHðABÞj where HðABÞ ¼ fg 2 G : gðABÞ ¼ ABg: Motivated by the study of a problem in finite fields, we prove an analogous result for vector spaces over a field
## Abstract In 1966, Chartrand proved that if the minimum degree of a graph is at least the floor of half the number of nodes, then its edge‐connectivity equals its minimum degree. A more discriminating notion of edge‐connectivity is introduced, called the __k__‐component order edge‐connectivity, w