By Associate Professor Anita Liebenau

Preprints

Lesgourgues T; Liebenau A; Taylor N, 2025, Ramsey with purple edges, https://arxiv.org/abs/2505.01034v2

Liebenau A; Saffidine A; Yang J, 2025, An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game, https://doi.org/10.37236/14172

Altman D; Liebenau A, 2024, On the uncommonness of minimal rank-2 systems of linear equations, https://arxiv.org/abs/2404.18908v1

Balogh J; Liebenau A; Mattos L; Morrison N, 2024, On multicolor Turán numbers, https://arxiv.org/abs/2402.05060v2

Allen P; Böttcher J; Liebenau A, 2023, Universality for graphs of bounded degeneracy, https://arxiv.org/abs/2309.05468v1

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.02877v1

Kamčev N; Liebenau A; Morrison N, 2021, Towards a characterisation of Sidorenko systems, https://doi.org/10.1093/qmath/haad013

Kamčev N; Liebenau A; Morrison N, 2021, On uncommon systems of equations, https://arxiv.org/abs/2106.08986v3

Liebenau A; Mattos L; Mendonça W; Skokan J, 2020, Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles, https://arxiv.org/abs/2010.11933v1

Kamčev N; Liebenau A; Wormald N, 2020, Asymptotic enumeration of hypergraphs by degree sequence, https://doi.org/10.19086/aic.32357

Liebenau A; Wormald N, 2020, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, https://arxiv.org/abs/2006.15797v1

Liebenau A; Nenadov R, 2020, The threshold bias of the clique-factor game, https://arxiv.org/abs/2002.02578v1

Bodkin C; Liebenau A; Wanless IM, 2019, Most binary matrices have no small defining set, https://doi.org/10.1016/j.disc.2020.112035

Kamcev N; Liebenau A; Wood DR; Yepremyan L, 2019, The size Ramsey number of graphs with bounded treewidth, https://arxiv.org/abs/1906.09185v2

Liebenau A; Pilipczuk M; Seymour P; Spirkl S, 2018, Caterpillars in Erdős-Hajnal, https://arxiv.org/abs/1810.00811v1

Clemens D; Liebenau A; Reding D, 2018, On minimal Ramsey graphs and Ramsey equivalence in multiple colours, https://doi.org/10.1017/S0963548320000036

Liebenau A; Wormald N, 2017, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, https://arxiv.org/abs/1702.08373v3

Bloom TF; Liebenau A, 2015, Ramsey equivalence of $K_n$ and $K_n+K_{n-1}$, https://arxiv.org/abs/1508.03866v1

Choromanski K; Falik D; Liebenau A; Patel V; Pilipczuk M, 2015, Excluding hooks and their complements, https://arxiv.org/abs/1508.00634v2

Fox J; Grinshpun A; Liebenau A; Person Y; Szabo T, 2015, On the minimum degree of minimal Ramsey graphs for multiple colours, https://arxiv.org/abs/1502.02881v1

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

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

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

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

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

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

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

Back to profile page