We prove the following result: For every two natural numbers n and q, n ~> q + 2, there is a natural number E(n, q) satisfying the following: (1) Let S be any set of points in the plane, no three on a line. If lSl ~> E(n, q), then there exists a convex n-gon whose points belong to S, for which the
A new generalized upper-bound solution for the ECAE process
β Scribed by K. Abrinia; M. J. Mirnia
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 363 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general
## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any twoβcoloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ββ₯ 2^_
The structured singular value (s.s.v) enables the study of robust stability and performance of a controller in the presence of real parametric uncertainties and complex uncertainties corresponding to neglected dynamics. In spite of the NP-hard characteristic of the problem, it is now possible to com