Given a set of n blue and n red points in the plane, not all on a line, it is shown that there exists a bichromatic line passing through at most two blue points and at most two red points. There does not necessarily exist a line passing through precisely one blue and one red point. This result is ex
On small line sets with few odd-points
โ Scribed by Vandendriessche, Peter
- Book ID
- 121558920
- Publisher
- Springer
- Year
- 2014
- Tongue
- English
- Weight
- 187 KB
- Volume
- 75
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A halving is a t-design which has the same parameters as its complementary design. Together these two designs form a large set LS[2](t, k, v). There are several recursion theorems for large sets, such that a single new halving results in several new infinite families of halvings. We present new halv
X is a finite set and R is a partition of ลฝ . X = X. We say that X, R is quasi-thin if each element of R has a valency of at most two. In this paper we focus on quasi-thin association schemes with an odd ลฝ . number of points and obtain that X, R has a regular automorphism group when n is square-free