István Tomon - “Ramsey properties of algebraic graphs and hypergraphs“ | MoCCA’20

The talk “Ramsey properties of algebraic graphs and hypergraphs“ by István Tomon on the Moscow Conference on Combinatorics and Applications at MIPT. Annotation: It is a central problem in graph theory to find explicit constructions of graphs with good Ramsey properties (that is, graphs containing only very small cliques and independent sets). One natural approach is to construct such graphs algebraically. We say that a graph is algebraic of complexity (n, d, m) if its vertices are elements of an n dimensional space over some field, and its edges are defined by the zero-patterns of m polynomials of degree at most d. I will discuss the Ramsey properties of such graphs and talk about related results for algebraic hypergraphs as well. The full schedule of the conference -