La Trobe

On r-equichromatic lines with few points in C²

Download (101.68 kB)
journal contribution
posted on 2024-10-11, 05:37 authored by Dickson Yaw Badu AnnorDickson Yaw Badu Annor

Let P be a set of n green and n − k red points in C2. A line determined by i green and j red points such that i + j ≥ 2 and |i − j|≤ r is called r-equichromatic. We establish lower bounds for 1-equichromatic and 2-equichromatic lines. In particular, we show that if at most 2n − k − 2 points of P are collinear, then the number of 1-equichromatic lines passing through at most six points is at least 1/4 (6n − k(k + 3)), and if at most 2/3 (2n − k) points of P are collinear, then the number of 2-equichromatic 3 lines passing through at most four points is at least 1/6 (10n − k(k + 5)).

History

Publication Date

2024-10-01

Journal

Australasian Journal of Combinatorics

Volume

90

Pagination

6p. (p. 60-65)

Publisher

Combinatorial Mathematics Society of Australasia

ISSN

1034-4942

Rights Statement

© The author(s) [2024]. Released under the CC BY-ND 4.0 International License.

Usage metrics

    Journal Articles

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC