51Թapp

Associate Professor Anita Liebenau

Associate Professor Anita Liebenau

Associate Professor
Science
School of Mathematics & Statistics

In July 2018, I joined UNSW Sydney as a Lecturer (Senior Lecturer since July 2020).

Previously, I was at Monash University, first as a postdoc with Nick Wormald and then as a Decra Fellow. Before that, I held a postdoc position with Dan Král' at the University of Warwick. Prior to that, I finished my doctoral studies in 2013 at the Free University Berlin under the supervision of Tibor Szabó.  

My research is in extremal and probabilistic combinatorics. I have worked on enumeration problems of large discrete structures such as d-regular graphs, on problems in Ramsey theory, and on combinatorial games played on graphs. Please visit my for more details on my research, including a full list of papers. 

Phone
9385 7099
Location
School of Mathematics and Statistics UNSW Sydney NSW 2052, AUSTRALIA The Red Centre Room 6105
  • Book Chapters | 2013
    Clemens D; Ferber A; Glebov R; Hefetz D; Liebenau A, 2013, 'Building spanning trees quickly in Maker-Breaker games', in The Seventh European Conference on Combinatorics, Graph Theory and Applications, Scuola Normale Superiore, pp. 365 - 370,
    Book Chapters | 2013
    Clemens D; Liebenau A, 2013, 'On the threshold bias in the oriented cycle game', in The Seventh European Conference on Combinatorics, Graph Theory and Applications, Scuola Normale Superiore, pp. 359 - 363,
    Book Chapters | 2013
    Ebert F; Liebenau A, 2013, 'Arvin, Berit und die Lastwagen', in Besser als Mathe, Springer Fachmedien Wiesbaden, pp. 151 - 160,
    Book Chapters | 2010
    Ebert F; Liebenau A, 2010, 'Arvin, Berit und die Lastwagen', in Besser als Mathe, Vieweg+Teubner, pp. 151 - 160,
  • Journal articles | 2024
    Balogh J; Liebenau A; Mattos L; Morrison N, 2024, 'ON MULTICOLOR TURÁN NUMBERS', SIAM Journal on Discrete Mathematics, 38, pp. 2297 - 2311,
    Journal articles | 2024
    Kamčev N; Liebenau A; Morrison N, 2024, 'On uncommon systems of equations', Israel Journal of Mathematics,
    Journal articles | 2024
    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,
    Journal articles | 2023
    Kamčev N; Liebenau A; Morrison N, 2023, 'Towards a characterization of Sidorenko systems', Quarterly Journal of Mathematics, 74, pp. 957 - 974,
    Journal articles | 2023
    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,
    Journal articles | 2023
    Liebenau A; Wormald N, 2023, 'Asymptotic enumeration of digraphs and bipartite graphs by degree sequence', Random Structures and Algorithms, 62, pp. 259 - 286,
    Journal articles | 2022
    Kamčev N; Liebenau A; Wormald N, 2022, 'Asymptotic Enumeration of Hypergraphs by Degree Sequence', Advances in Combinatorics, 2022,
    Journal articles | 2022
    Liebenau A; Nenadov R, 2022, 'The threshold bias of the clique-factor game', Journal of Combinatorial Theory. Series B, 152, pp. 221 - 247,
    Journal articles | 2021
    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,
    Journal articles | 2021
    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,
    Journal articles | 2020
    Bodkin C; Liebenau A; Wanless IM, 2020, 'Most binary matrices have no small defining set', Discrete Mathematics, 343, pp. 112035,
    Journal articles | 2020
    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,
    Journal articles | 2020
    Kamčev N; Liebenau A; Wormald N, 2020, 'Asymptotic enumeration of hypergraphs by degree sequence', Advances in Combinatorics 2022:1, 36pp,
    Journal articles | 2020
    Liebenau A; Nenadov R, 2020, 'The threshold bias of the clique-factor game', ,
    Journal articles | 2020
    Liebenau A; Pehova Y, 2020, 'An approximate version of Jackson's conjecture', Combinatorics Probability and Computing, 29, pp. 886 - 899,
    Journal articles | 2020
    Liebenau A; Wormald N, 2020, 'Asymptotic enumeration of digraphs and bipartite graphs by degree sequence', ,
    Journal articles | 2019
    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
    Journal articles | 2019
    Liebenau A; Pilipczuk M; Seymour P; Spirkl S, 2019, 'Caterpillars in Erdős–Hajnal', Journal of Combinatorial Theory. Series B, 136, pp. 33 - 43,
    Journal articles | 2018
    Bloom TF; Liebenau A, 2018, 'Ramsey equivalence of Kn and Kn + Kn–1', Electronic Journal of Combinatorics, 25,
    Journal articles | 2018
    Choromanski K; Liebenau A; Falik D; Patel V; Pilipczuk M, 2018, 'Excluding hooks and their complements', Electronic Journal of Combinatorics, 25,
    Journal articles | 2017
    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,
    Journal articles | 2017
    Kardoš F; Král’ D; Liebenau A; Mach L, 2017, 'First order convergence of matroids', European Journal of Combinatorics, 59, pp. 150 - 168,
    Journal articles | 2017
    Liebenau A; Wormald N, 2017, 'Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph', ,
    Journal articles | 2016
    Clemens D; Gebauer H; Liebenau A, 2016, 'The Random Graph Intuition for the Tournament Game', Combinatorics Probability and Computing, 25, pp. 76 - 88,
    Journal articles | 2016
    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,
    Journal articles | 2015
    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,
    Journal articles | 2015
    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,
    Journal articles | 2014
    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,
    Journal articles | 2012
    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,
  • Preprints | 2023
    Allen P; Böttcher J; Liebenau A, 2023, Universality for graphs of bounded degeneracy, ,
    Other | 2021
    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, ,
    Conference Papers | 2021
    Kamčev N; Liebenau A; Morrison N, 2021, 'Uncommon Systems of Equations', pp. 611 - 616,