Coloring random subgraphs of some distance graphs

Speaker:

Andrei Raigorodskii, Moscow Institute of Physics and Technology

Date and Time:

Monday, June 19, 2017 - 10:00am to 10:30am

Location:

Fields Institute, Stewart Library

Abstract:

In my talk, I will speak about the chromatic numbers of random subgraphs of some graphs, whose vertices are $ (0,1) $-vectors in $ {\mathbb R}^n $ with exactly $ r $ non-zero coordinates and whose edges are drawn between some two vertices, if and only if the inner product of the corresponding vectors equals $ s $ (so that the distance between them is $ \sqrt{2(r-s)} $). Note that for $ s = 0 $, we get random subgraphs of Kneser's graphs.

Scheduled as part of

Who we are

The Fields Institute is a centre for mathematical research activity - a place where mathematicians from Canada and abroad, from academia, business, industry and financial institutions, can come together to carry out research and formulate problems of mutual interest. Our mission is to provide a supportive and stimulating environment for mathematics innovation and education. Learn more about us.

The Fields Institute promotes mathematical activity in Canada and helps to expand the application of mathematics in modern society.

Everyone is welcome to register and participate in events at the Fields Institute.