By Associate Professor Anita Liebenau

Journal articles

Liebenau A; Wormald N, 2024, 'Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph', Journal of the European Mathematical Society, 26, pp. 1 - 40, http://dx.doi.org/10.4171/JEMS/1355

Kamčev N; Liebenau A; Morrison N, 2023, 'Towards a characterization of Sidorenko systems', Quarterly Journal of Mathematics, 74, pp. 957 - 974, http://dx.doi.org/10.1093/qmath/haad013

Liebenau A; Mattos L; Mendonça W; Skokan J, 2023, 'Asymmetric Ramsey properties of random graphs involving cliques and cycles', Random Structures and Algorithms, 62, pp. 1035 - 1055, http://dx.doi.org/10.1002/rsa.21106

Liebenau A; Wormald N, 2023, 'Asymptotic enumeration of digraphs and bipartite graphs by degree sequence', Random Structures and Algorithms, 62, pp. 259 - 286, http://dx.doi.org/10.1002/rsa.21105

Kamčev N; Liebenau A; Wormald N, 2022, 'Asymptotic Enumeration of Hypergraphs by Degree Sequence', Advances in Combinatorics, 2022, http://dx.doi.org/10.19086/aic.32357

Liebenau A; Nenadov R, 2022, 'The threshold bias of the clique-factor game', Journal of Combinatorial Theory. Series B, 152, pp. 221 - 247, http://dx.doi.org/10.1016/j.jctb.2021.10.001

Kamčev N; Liebenau A; Morrison N, 2021, 'Towards a characterisation of Sidorenko systems', The Quarterly Journal of Mathematics, Volume 74, Issue 3, September 2023, Pages 957-974, http://dx.doi.org/10.1093/qmath/haad013

Kamcev N; Liebenau A; Wood DR; Yepremyan L, 2021, 'The size ramsey number of graphs with bounded treewidth', SIAM Journal on Discrete Mathematics, 35, pp. 281 - 293, http://dx.doi.org/10.1137/20M1335790

Liebenau A; Pehova Y, 2020, 'An approximate version of Jackson's conjecture', Combinatorics Probability and Computing, 29, pp. 886 - 899, http://dx.doi.org/10.1017/S0963548320000152

Bodkin C; Liebenau A; Wanless IM, 2020, 'Most binary matrices have no small defining set', Discrete Mathematics, 343, pp. 112035, http://dx.doi.org/10.1016/j.disc.2020.112035

Kamčev N; Liebenau A; Wormald N, 2020, 'Asymptotic enumeration of hypergraphs by degree sequence', Advances in Combinatorics 2022:1, 36pp, http://dx.doi.org/10.19086/aic.32357

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

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

Clemens D; Liebenau A; Reding D, 2020, 'On minimal Ramsey graphs and Ramsey equivalence in multiple colours', Combinatorics Probability and Computing, 29, pp. 537 - 554, http://dx.doi.org/10.1017/S0963548320000036

Liebenau A; Mattos L; Mendonça W; Skokan J, 2019, 'Asymmetric Ramsey properties of random graphs involving cliques and cycles', Acta Mathematica Universitatis Comenianae, 88, pp. 917 - 922

Liebenau A; Pilipczuk M; Seymour P; Spirkl S, 2019, 'Caterpillars in Erdős–Hajnal', Journal of Combinatorial Theory. Series B, 136, pp. 33 - 43, http://dx.doi.org/10.1016/j.jctb.2018.09.002

Choromanski K; Liebenau A; Falik D; Patel V; Pilipczuk M, 2018, 'Excluding hooks and their complements', Electronic Journal of Combinatorics, 25, http://dx.doi.org/10.37236/6397

Bloom TF; Liebenau A, 2018, 'Ramsey equivalence of Kn and Kn + Kn–1', Electronic Journal of Combinatorics, 25, http://dx.doi.org/10.37236/7554

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

Clemens D; Liebenau A, 2017, 'A non-trivial upper bound on the threshold bias of the Oriented-cycle game', Journal of Combinatorial Theory. Series B, 122, pp. 21 - 54, http://dx.doi.org/10.1016/j.jctb.2016.05.002

Kardoš F; Král’ D; Liebenau A; Mach L, 2017, 'First order convergence of matroids', European Journal of Combinatorics, 59, pp. 150 - 168, http://dx.doi.org/10.1016/j.ejc.2016.08.005

Fox J; Grinshpun A; Liebenau A; Person Y; Szabó T, 2016, 'On the minimum degree of minimal Ramsey graphs for multiple colours', Journal of Combinatorial Theory. Series B, 120, pp. 64 - 82, http://dx.doi.org/10.1016/j.jctb.2016.03.006

Clemens D; Gebauer H; Liebenau A, 2016, 'The Random Graph Intuition for the Tournament Game', Combinatorics Probability and Computing, 25, pp. 76 - 88, http://dx.doi.org/10.1017/S096354831500019X

Clemens D; Ferber A; Glebov R; Hefetz D; Liebenau A, 2015, 'Building spanning trees quickly in maker-breaker games', SIAM Journal on Discrete Mathematics, 29, pp. 1683 - 1705, http://dx.doi.org/10.1137/140976054

Glebov R; Liebenau A; Szabó T, 2015, 'On the concentration of the domination number of the random graph', SIAM Journal on Discrete Mathematics, 29, pp. 1186 - 1206, http://dx.doi.org/10.1137/12090054X

Fox J; Grinshpun A; Liebenau A; Person Y; Szabó T, 2014, 'What is ramsey-equivalent to a clique?', Journal of Combinatorial Theory. Series B, 109, pp. 120 - 133, http://dx.doi.org/10.1016/j.jctb.2014.06.003

Clemens D; Ferber A; Krivelevich M; Liebenau A, 2012, 'Fast strategies in makera-breaker games played on random boards', Combinatorics Probability and Computing, 21, pp. 897 - 915, http://dx.doi.org/10.1017/S0963548312000375

Back to profile page