A Short Proof of a Generalization on Opial′s Inequality
✍ Scribed by X.G. He
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 42 KB
- Volume
- 182
- Category
- Article
- ISSN
- 0022-247X
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
In this paper we are concerned with the following conjecture. Conjecture: Let L be a collection of k positive integers and In particular, we show this conjecture is true when L consists of k consecutive positive integers. This generalizes a well-known inequality of Fisher's. Our proof simplifies an
Ao and Hanson, and Guiduli, Gya  rfa  s, Thomasse  and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Á Á Á s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an