A short proof for Arnold’s Theorem on the SFT-property
✍ Scribed by Ali Benhissi
- Book ID
- 118824154
- Publisher
- Springer Milan
- Year
- 2012
- Tongue
- Italian
- Weight
- 214 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0009-725X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re
We give a very short proof for the Kruskal-Katona theorem and Lovhsz's version of it: given (~) k-element sets there are at least (k~\_l) (k -1)-element sets which are contained in at least one of the k-sets.
## Abstract In this note a shortened proof is given for the Faudree—Schelp theorem on path‐connected graphs.