## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.
Reciprocal extremal problems in function theory
β Scribed by Peter D. Lax
- Publisher
- John Wiley and Sons
- Year
- 1955
- Tongue
- English
- Weight
- 885 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Our main discovery is the following identity: non-empty subsets of D = [ I, 2. . 11) AHLSWEDE AND ZHANG THEOREM 1. For ever)! ,fbmil>~ .d qf' non-rrnpt?) suh.yet,s nf'Q = ( 1, 2, . . . . tl i i w+ ,=I i 0 i Proof: Note first that only the minimal elements in .d determine X,,, and therefore matter. W
## Abstract For a graph __G__, the cochromatic number of __G__, denoted __z__(__G__), is the least __m__ for which there is a partition of the vertex set of __G__ having order __m__. where each part induces a complete or empty graph. We show that if {__G__~__n__~} is a family of graphs where __G__