By Associate Professor Anita Liebenau

Preprints

Kardos F; Kral D; Liebenau A; Mach L, 2015, First order convergence of matroids, http://arxiv.org/abs/1501.06518v3

Clemens D; Liebenau A, 2014, A non-trivial upper bound on the threshold bias of the Oriented-cycle game, http://arxiv.org/abs/1404.4529v2

Fox J; Grinshpun A; Liebenau A; Person Y; Szabo T, 2013, What is Ramsey-equivalent to a clique?, http://arxiv.org/abs/1312.0299v1

Clemens D; Gebauer H; Liebenau A, 2013, The random graph intuition for the tournament game, http://dx.doi.org/10.1017/S096354831500019X

Clemens D; Ferber A; Glebov R; Hefetz D; Liebenau A, 2013, Building spanning trees quickly in Maker-Breaker games, http://arxiv.org/abs/1304.4108v1

Glebov R; Liebenau A; Szabó T, 2012, On the Concentration of the Domination Number of the Random Graph, http://arxiv.org/abs/1209.3115v4

Clemens D; Ferber A; Krivelevich M; Liebenau A, 2012, Fast strategies in Maker-Breaker games played on random boards, http://arxiv.org/abs/1203.3444v1

Other

Bishnoi A; Boyadzhiyska S; Clemens D; Gupta P; Lesgourgues T; Liebenau A, 2021, On the minimum degree of minimal Ramsey graphs for cliques versus cycles, https://arxiv.org/abs/2109.02877

Back to profile page