A discrete variation on Kronecker's theorem
β Scribed by P.G. Spain
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 158 KB
- Volume
- 223-224
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A min-max property of bipartite graphs is stated; it is a variation on the theorem of Kiinig 'maximum x%zhing= minimum covering'; one shows that a c&&i inequaliw holds for any graph and the equality for bipartite graphs is derived from a simple network flow model. -. ## Various extensions of the t
## IN HONOR OF KY FAN Ekeland's variational principle states that if a Gateaux differentiable Ε½ . function f has a finite lower bound although it need not attain it , then 5 X Ε½ .5 for every β ) 0, there exists some point x such that f x F β. This β β Ε½ . Ε½ .