check
Combinatorics: Shoham Letzter (UCL) | Einstein Institute of Mathematics

Combinatorics: Shoham Letzter (UCL)

Date: 
Mon, 04/01/202111:00-13:00
Location: 
https://huji.zoom.us/j/88114702258?pwd=SllxczVjQTJLV0w1TkZFQjBUSGx6dz09


HUJI Combinatorics Seminar 

When: Monday Jan 4th, 2021, at 11AM

Zoom link: 
https://huji.zoom.us/j/88114702258?pwd=SllxczVjQTJLV0w1TkZFQjBUSGx6dz09

Speaker: Shoham Letzter (UCL)
Title: The Size-Ramsey number of powers of tight paths

Abstract: 
The s-colour size-Ramsey number of a hypergraph H is the minimum number of edges in a hypergraph G whose every s-edge-colouring contains a monochromatic copy of H. We show that for every s, r, l, the s-colour size-Ramsey number of the l-th power of a tight r-uniform path on n vertices is O(n), answering a question of Dudek, La Fleur, Mubayi, and Rödl.

This is joint work with Alexey Pokrovskiy and Liana Yepremyan.