Combinatorial theorems relative to sparse sets
Combinatorics
2026-08-02 v1
Abstract
A key theme in modern extremal combinatorics is the study of classical combinatorial theorems relative to sparse subsets of their natural settings. Here we describe some of the recent progress in this area and state a number of problems that remain open and pressing.
Cite
@article{arxiv.2608.01525,
title = {Combinatorial theorems relative to sparse sets},
author = {David Conlon},
journal= {arXiv preprint arXiv:2608.01525},
year = {2026}
}
Comments
16 pages, survey written for the Proceedings of the 2025 ICBS