A lower bound for the k‐multicolored sum‐free problem in Zmn
Main Authors: | Lovász, László Miklós, Sauermann, Lisa |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Wiley
2022
|
Online Access: | https://hdl.handle.net/1721.1/140895 |
Similar Items
-
Regularity and removal lemmas and their applications
by: Lovász, László Miklós
Published: (2017) -
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
by: Barak, Boaz, et al.
Published: (2022) -
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
by: Barak, Boaz, et al.
Published: (2018) -
A fast new algorithm for weak graph regularity
by: Lovász, László Miklós, et al.
Published: (2020) -
Elusive extremal graphs
by: Grzesik, Andrzej, et al.
Published: (2022)