A sperner-type theorem and qualitative independence
✍ Scribed by János Körner; Gábor Simonyi
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 603 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known
## Abstract Let __Q__ be a non‐degenerate quadric defined by a quadratic form in the finite projective space PG(__d,q__). Let __r__ be the dimension of the generators of __Q__. For all __k__ with 2 ≤ __k__ < __r__ we determine the smallest cardinality of a set __B__ of points with the property that
In this paper Lewontin's notion of "quasi-independence" of characters is formalized as the assumption that a region of the phenotype space can be represented by a product space of orthogonal factors. In this picture each character corresponds to a factor of a region of the phenotype space. We consid