Quasi-random hypergraphs (QuasiHyp) was a 3-year project at Emory University and Universität Hamburg supported by Marie Skłodowska-Curie Actions Global Fellowship from Horizon 2020.
In April 2019, the project was suspended for medical reasons.
List of research papers that were supported by QuasiHyp
- R. Glebov, D. Kráľ, J. Volec:
Compactness and finite forcibility of graphons,
Journal of the European Mathematical Society 21 (2019), 3199-3223.
Also available as arXiv:1309.6695.
- A. Blumenthal, B. Lidický, O. Pikhurko, Y. Pehova, F. Pfender, J. Volec:
Sharp bounds for decomposing graphs into edges and tringles,
Combinatorics, Probability and Computing 30 (2021), 271-287.
Also available as arXiv:1909.11371.
- A. Blumenthal, B. Lidicky, R. Martin, S. Norin, F. Pfender, J. Volec:
Counterexamples to a conjecture of Harris on Hall ratio,
SIAM Journal on Discrete Mathematics 36 (2022), 1678-1686.
Also available as arXiv:1811.11116.
- A. Grzesik, J. Lee, B. Lidický, J. Volec:
On tripartite common graphs,
Combinatorics, Probability and Computing 31 (2022), 907-923.
Also available as arxiv:2012.02057.
- X. Goaoc, A. Hubard, R. de Joannis de Verclos, J.-S. Sereni, J. Volec:
Limits of Order Types,
manuscript. A preprint available as arXiv:1811.02236.
List of presentations based on research supported by QuasiHyp
This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 800607.