Extremal Problems in Combinatorics
Lead Research Organisation:
University of Cambridge
Department Name: Pure Maths and Mathematical Statistics
Abstract
The project consists of examination of a number of extremal problems. The aim will be to tackle them using direct methods and also probabilistic and algebraic tools. Particular problems will include the Sandglass Conjecture of Simonyi and the Path-Intersection Conjecture of Alon.
Organisations
People |
ORCID iD |
| I Leader (Primary Supervisor) | |
| Barnabas Janzer (Student) |
Publications
Espuny Díaz A
(2024)
Long running times for hypergraph bootstrap percolation
in European Journal of Combinatorics
Gowers W
(2020)
Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques
in Combinatorics, Probability and Computing
Janzer B
(2022)
A note on saturation for $k$-wise intersecting families
in Combinatorial Theory
Janzer B
(2022)
The Generalized Rainbow Turán Problem for Cycles
in SIAM Journal on Discrete Mathematics
Janzer B
(2020)
Projections of Antichains
in The Electronic Journal of Combinatorics
Janzer B
(2021)
A note on the orientation covering number
in Discrete Applied Mathematics
Janzer B
(2024)
Rotation Inside Convex Kakeya Sets
in Discrete & Computational Geometry
Janzer B
(2021)
Large hypergraphs without tight cycles
in Combinatorial Theory
Studentship Projects
| Project Reference | Relationship | Related To | Start | End | Student Name |
|---|---|---|---|---|---|
| EP/N509620/1 | 30/09/2016 | 29/09/2022 | |||
| 2261055 | Studentship | EP/N509620/1 | 30/09/2019 | 31/01/2023 | Barnabas Janzer |
| EP/R513180/1 | 30/09/2018 | 29/09/2023 | |||
| 2261055 | Studentship | EP/R513180/1 | 30/09/2019 | 31/01/2023 | Barnabas Janzer |