| Speaker: Jozsef Solymosi Affiliation: University of British Columbia Time: 14:00 Tuesday, 25 September, 2018 Location: 303-257 |
| The first open case of the Brown, Erdos, Sos conjecture - a central problem in extremal combinatorics - is equivalent to the following. For every c > 0 if a quasigroup has large enough order, denoted by n, then every c-dense subset of the pairs of group elements contains four pairs (a, b),(c, d),(a, d), and (c, b) such that ab=cd. In this talk we prove the conjecture for finite groups and show that for groups an even stronger statement holds. |