Semi-definite method in Combinatorics

点击翻译按钮获取中文摘要

The goal of this proposal is a systematic investigation of a class of problems of in extremal combinatorics using semi-definite programming and structural methods. Extremal combinatorics is an important and active area of discrete mathematics, investigating maximum size of a combinatorial structure satisfying certain requirements. Results in extremal combinatorics are frequently related to problems in computer science, information theory, number theory and/or geometry.