Cookie Setting MathNet Korea

이전페이지 이동
On the maximum number of integer colourings with forbidden monochromatic sums
[2017 Discrete Math 세미나]
Date: 2017-12-27
Speaker : Hong Liu (University of Warwick, Warwick, UK)
Abstract : Let f(n,r) denote the maximum number of colourings of A⊆{1,…,n} with r colours such that each colour class is sum-free. Here, a sum is a subset {x,y,z} such that x+y=z. We show that f(n,2) = 2^(⌈n/2⌉), and describe the extremal subsets. Further, using linear optimisation, we asymptotically determine the logarithm of f(n,r) for r≤5. Joint work with Maryam Sharifzadeh and Katherine Staden.
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail :
Copyright (C) 2018. ICMS All Rights Reserved.