7 citations · 33 across the 19 of their papers we have counts for
27 papers
An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game
Anita Liebenau, Abdallah Saffidine, Jeffrey Yang
We study the -biased Oriented-cycle game where two players, OMaker and OBreaker, take turns directing the edges of (the complete graph on vertices). In each round, OMa…
On multicolor Turán numbers
József Balogh, Anita Liebenau, Letícia Mattos +1
We address a problem which is a generalization of Turán-type problems recently introduced by Imolay, Karl, Nagy and Váli. Let be a fixed graph and let be the union of e…
Universality for graphs of bounded degeneracy
Peter Allen, Julia Böttcher, Anita Liebenau
Given a family of graphs, a graph is called -universal if contains every graph of as a subgraph. Following the extensive research o…
On the minimum degree of minimal Ramsey graphs for cliques versus cycles
Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens +3
A graph is said to be -Ramsey for a -tuple of graphs , denoted by , if every -edge-coloring of contains a monochromatic c…
Towards a characterisation of Sidorenko systems
Nina Kamčev, Anita Liebenau, Natasha Morrison
A system of linear forms over is said to be Sidorenko if the number of solutions to in any is asymptotica…
On uncommon systems of equations
Nina Kamčev, Anita Liebenau, Natasha Morrison
A system of linear equations over is common if the number of monochromatic solutions to in any two-colouring of is asymptotically at least t…
Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles
Anita Liebenau, Letícia Mattos, Walner Mendonça +1
We say that if, in every edge colouring , we can find either a -coloured copy of or a -coloured copy of . The well-known Kohayakawa-…
Asymptotic enumeration of hypergraphs by degree sequence
Nina Kamčev, Anita Liebenau, Nick Wormald
We prove an asymptotic formula for the number of -uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asym…
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
Anita Liebenau, Nick Wormald
We provide asymptotic formulae for the numbers of bipartite graphs with given degree sequence, and of loopless digraphs with given in- and out-degree sequences, for a wide range of…
The threshold bias of the clique-factor game
Anita Liebenau, Rajko Nenadov
Let be an integer and consider the following game on the complete graph for : Two players, Maker and Breaker, alternately claim previously uncla…
Most binary matrices have no small defining set
Carly Bodkin, Anita Liebenau, Ian M. Wanless
Consider a matrix chosen uniformly at random from a class of matrices of zeros and ones with prescribed row and column sums. A partially filled matrix is a $\m…
The size Ramsey number of graphs with bounded treewidth
Nina Kamcev, Anita Liebenau, David R. Wood +1
A graph is Ramsey for a graph if every 2-colouring of the edges of contains a monochromatic copy of . We consider the following question: if has bounded treewidt…
An approximate version of Jackson's conjecture
Anita Liebenau, Yanitsa Pehova
In 1981 Jackson showed that the diregular bipartite tournament (a complete bipartite graph whose edges are oriented so that every vertex has the same in- and outdegree) contains a…
Caterpillars in Erdős-Hajnal
Anita Liebenau, Marcin Pilipczuk, Paul Seymour +1
Let be a tree such that all its vertices of degree more than two lie on one path, that is, is a caterpillar subdivision. We prove that there exists such that for ever…
On minimal Ramsey graphs and Ramsey equivalence in multiple colours
Dennis Clemens, Anita Liebenau, Damian Reding
For an integer , a graph is called -Ramsey for a graph if every -colouring of the edges of contains a monochromatic copy of . If is -Ramsey for…
The Erdős-Hajnal conjecture for caterpillars and their complements
Anita Liebenau, Marcin Pilipczuk
The celebrated Erdős-Hajnal conjecture states that for every proper hereditary graph class there exists a constant such t…
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
Anita Liebenau, Nick Wormald
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjectur…
Ramsey equivalence of and
Thomas F. Bloom, Anita Liebenau
We prove that, for , the graphs and are Ramsey equivalent. That is, if is such that any red-blue colouring of its edges creates a monochromatic $K_…
Excluding hooks and their complements
Krzysztof Choromanski, Dvir Falik, Anita Liebenau +2
The celebrated Erdos-Hajnal conjecture states that for every -vertex undirected graph there exists $\eps(H)>0$ such that every graph that does not contain as an indu…
On the minimum degree of minimal Ramsey graphs for multiple colours
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minima…
First order convergence of matroids
Frantisek Kardos, Daniel Kral, Anita Liebenau +1
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse struc…
A non-trivial upper bound on the threshold bias of the Oriented-cycle game
Dennis Clemens, Anita Liebenau
In the Oriented-cycle game, introduced by Bollobás and Szabó, two players, called OMaker and OBreaker, alternately direct edges of . OMaker directs exactly one edge, whereas O…
What is Ramsey-equivalent to a clique?
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if…
The random graph intuition for the tournament game
Dennis Clemens, Heidi Gebauer, Anita Liebenau
In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two…