conjecture. The third highlight of the workshop was presented by Aleksa Milojević and Istvan Tomon in two consecutive talks, which covered their joint work with Zhihan Jin…
Statement
conjecture. The third highlight of the workshop was presented by Aleksa Milojević and Istvan Tomon in two consecutive talks, which covered their joint work with Zhihan Jin and Shengtong Zhang on spectral graph theory and its applications to the maximum cut problem in graphs and to Chowla’s cosine problem in harmonic analysis. This work was later featured in an article in Quanta. Their main result shows that a graph with average degree d and smallest eigenvalue \lambdan satisfies |\lambdan | \leq d1−\alpha contains a clique of size d1−O(\alpha) . One application gives a substantially better upper bound for the minimum of cosine polynomials. Another application shows that the Edwards bound on the maximum cut of a graph can be substantially improved for graphs that don’t contain a very large clique. The report passage is retained verbatim as the relevant context for this extracted problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.