GAČRExtremal and Probabilistic Combinatorics (GAČR 23-06815M)

EPC – Extremal and Probabilistic Combinatorics – is a 5-year project from January 1, 2023 to December 31, 2027 at Czech Technical University in Prague supported by Czech Science Foundation.


Team members (ordered by the starting date):

List of research outputs supported by the project:

  1. Balogh, Clemen, Lidický, Norin, Volec: The Spectrum of Triangle-Free Graphs, SIAM Journal on Discrete Mathematics 37 (2023), 1173-1179.
  2. Trödler, Volec, Vybíral: A tight lower bound on the minimal dispersion, European Journal of Combinatorics 120 (2024), article no. 103945, 5pp.
  3. Kráľ, Volec, Wei: Common graphs with arbitrary chromatic number, Compos. Math. 161 (2025), 594-634.
  4. Trödler, Volec, Vybíral: Lower bounds on the minimal dispersion of point sets via cover-free families, Journal of Complexity 91 (2025), article no. 101974, 7pp. Extended Abstract accepted to Eurocomb 2025.
  5. Grzesik, Rödl, Volec: Subgraphs with a positive minimum semidegree in digraphs with large outdegree, Innovations in Graph Theory 2 (2025), 301-312.
  6. Lang, Schacht, Volec: Tight Hamiltonicity from dense links of triples, submitted.
  7. Černá, Kielak, Volec: On Shattering Triples with Six Permutations, Extended Abstract accepted to Eurocomb 2025.
  8. Balogh, Lidický, Mubayi, Pfender, Volec: Semi-Inducibility of some small graphs, submitted.
  9. Kráľ, Krnc, Kučerák, Lidický, Volec: Sidorenko property and forcing in regular tournaments, submitted.

List of presentations supported by the project:


A brief project log – 2023:

A brief project log – 2024:

A brief project log – 2025:

A brief project log – 2026: