Publication:
On the minimum number of monochromatic generalized Schur triples

1

Issued Date

2017-05-05

Resource Type

Article

ISSN

10778926

Other identifier(s)

2-s2.0-85019119627

Rights

Mahidol University

Rights Holder(s)

SCOPUS

Bibliographic Citation

Electronic Journal of Combinatorics. Vol.24, No.2 (2017)

Suggested Citation

Thotsaporn Thanatipanonda, Elaine Wong On the minimum number of monochromatic generalized Schur triples. Electronic Journal of Combinatorics. Vol.24, No.2 (2017). Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/42384

Research Projects

Organizational Units

Authors

Journal Issue

Thesis

Title

On the minimum number of monochromatic generalized Schur triples

Author(s)

Thotsaporn Thanatipanonda
 Elaine Wong

Other Contributor(s)

Mahidol University

Abstract

© 2017, Australian National University. All rights reserved. The solution to the problem of finding the minimum number of monochromatic triples (x, y, x + ay) with a ≥ 2 being a fixed positive integer over any 2-coloring of [1, n] was conjectured by Butler, Costello, and Graham (2010) and Thanathipanonda (2009). We solve this problem using a method based on Datskovsky’s proof (2003) on the minimum number of monochromatic Schur triples (x, y, x + y). We do this by exploiting the combinatorial nature of the original proof and adapting it to the general problem.

Keyword(s)

Computer Science

Availability

URI

https://repository.li.mahidol.ac.th/handle/123456789/42384

Collections

Scopus 2016-2017