Combinatorial group
Here you can find the outputs of the project Random Discrete Structures, project number GJ20-27757Y, funded by the Czech Science foundation. For other outputs, please visit this page. In bold you find the authors that were supported by the grant.

Preprints

Deviation probabilities for arithmetic progressions and irregular discrete structures, S. Griffiths, C. Koch, M. Secco

Non-homotopic Loops with a Bounded Number of Pairwise Intersections, V. Blažej, M. Opler, M. Šileikis, P. Valtr (2021), To appear in Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)

Conference proceedings

On the Intersections of Non-homotopic Loops, V. Blažej, M. Opler, M. Šileikis, P. Valtr (2021), In: Mudgal A., Subramanian C.R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2021. Lecture Notes in Computer Science, vol 12601. Springer, Cham.

Accepted journal papers

Sandwiching biregular random graphs, T. Klimošová, C. Reiher, A. Ruciński, M. Šileikis, accepted to Combinatorics, Probability and Computing

Journal papers revised during the project

Upper tail bounds for Stars, M. Šileikis, L. Warnke, The Electronic Journal of Combinatorics, Volume 27, Issue 1 (2020)

A limit theorem for small cliques in inhomogeneous random graphs, J. Hladký, C. Pelekis, M. Šileikis, Journal of Graph Theory, 97-4, pp. 578-599 (2021)

Counting extensions revisited, M. Šileikis, L. Warnke, accepted to Random Structures & Algorithms (2021+), DOI:10.1002/rsa.21050