Homepage of Jan Volec

---

• Google Scholar
• dblp
• 0000-0002-5310-3797
• 37065231400
• 952897
• AAM-2955-2020

---

I am an assistant professor at the Czech Technical University in Prague. Since 2025, I am a member of the research group G²OAT, a part of the Department of Theoretical Computer Science at the Faculty of Information Technology. From 2020 to 2024, I was a member of the research group TIGR, a part of the Department of Mathematics at the Faculty of Nuclear Sciences and Physical Engineering.

Before joining Czech TU, I was as a postdoc at Masaryk University, a Marie Skłodowska-Curie Actions GF at Emory and Universität Hamburg, a CRM-ISM fellow at McGill, and a postdoc at ETH. I did my joint PhD (cotutelle) in maths at Warwick and CS at Université Paris Diderot under the supervision of Dan Kráľ and Jean Sébastien Sereni.

Contact details

• Department of Theoretical Computer Science at FIT (Thákurova 9)
• jan [AT] ucw [DOT] cz

Research interests

• Extremal and probabilistic combinatorics
• Computer-aided proofs
• Structural graph theory
• Ramsey theory

Research awards and funding

• Neuron Prize for young mathematicians (2024)
• Czech Science Foundation (GAČR), JuniorStar grant – Project Extremal & Probabilistic Combinatorics (Jan 2023 - Dec 2027)
• Horizon 2020, MSCA Global Fellowship – Project Quasi-random Hypergraphs (Oct 2018 - Sep 2021, suspended in Apr 2019 for medical reasons)
• CRM-ISM fellowship (Sep 2016 - Aug 2018)
• Warwick Faculty of Science Doctoral Thesis Award (2015)
• Campus France Scholarship (Apr 2012 - Aug 2014)
• GAUK – Charles University Grant Agency (Apr 2012 - Dec 2014, terminated in Dec 2012 due to contiuning my studies at Warwick)

PhD students

• Daniela Černá (née Opočenská) (ČVUT FJFI)

Ten selected research publications

• D. Kráľ, J. Volec, F. Wei: Common graphs with arbitrary chromatic number, accepted to Compositio Mathematica.
• A. Grzesik, J. Volec: Degree conditions forcing directed cycles, Int. Math. Res. Not. 2023 (2023), 9711–9753.
• V. Falgas-Ravry, O. Pikhurko, E. Vaughan, J. Volec: The codegree threshold of K4-, J. Lond. Math. Soc. 107 (2023), 1660-1691.
• D. Kráľ, J. A. Noel, S. Norin, J. Volec, F. Wei: Non-bipartite k-common graphs, Combinatorica 42 (2022), 87-114.
• R. Glebov, D. Kráľ, J. Volec: Compactness and finite forcibility of graphons, J. Eur. Math. Soc. 21 (2019), 3199-3223.
• A. Grzesik, P. Hu, J. Volec: Minimum number of edges that occur in odd cycles, J. Combin. Theory Ser. B 137 (2019), 65-103.
• B. Sudakov, J. Volec: Properly colored and rainbow copies of graphs with few cherries, J. Combin. Theory Ser. B 122 (2017), 391-416.
• J. Balogh, P. Hu, B. Lidický, F. Pfender, J. Volec, M. Young: Rainbow triangles in three-colored graphs, J. Combin. Theory Ser. B 126 (2017), 83-113.
• R. Glebov, D. Kráľ, J. Volec: A problem of Erdos and Sos on 3-graphs, Israel J. Math. 211 (2016), 349-366.
• Z. Dvořák, J.-S. Sereni, J. Volec: Subcubic triangle-free graphs have fractional chromatic number at most 14/5, J. Lond. Math. Soc. 89 (2014), 641-662.

A Sparse (Graphs) Coalition – a collaborative network of researchers in discrete mathematics

Extremal and Probabilistic Combinatorics Webinar (April 2020 - December 2021)

• Organized together with Jan Hladký, Diana Piguet and Liana Yepremyan
• Archive of the lectures on YouTube