Anita Liebenau

According to our database1, Anita Liebenau authored at least 18 papers between 2012 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
The Size Ramsey Number of Graphs with Bounded Treewidth.
SIAM J. Discret. Math., 2021

2020
Most binary matrices have no small defining set.
Discret. Math., 2020

An approximate version of Jackson's conjecture.
Comb. Probab. Comput., 2020

On minimal Ramsey graphs and Ramsey equivalence in multiple colours.
Comb. Probab. Comput., 2020

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence.
CoRR, 2020

2019
Caterpillars in Erdős-Hajnal.
J. Comb. Theory, Ser. B, 2019

The size Ramsey number of graphs with bounded treewidth.
CoRR, 2019

2018
Excluding Hooks and their Complements.
Electron. J. Comb., 2018

Ramsey equivalence of K<sub>n</sub> and K<sub>n</sub>+K<sub>n-1</sub>.
Electron. J. Comb., 2018

2017
A non-trivial upper bound on the threshold bias of the Oriented-cycle game.
J. Comb. Theory, Ser. B, 2017

First order convergence of matroids.
Eur. J. Comb., 2017

The Erdős-Hajnal conjecture for caterpillars and their complements.
CoRR, 2017

2016
On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory, Ser. B, 2016

The Random Graph Intuition for the Tournament Game.
Comb. Probab. Comput., 2016

2015
On the Concentration of the Domination Number of the Random Graph.
SIAM J. Discret. Math., 2015

Building Spanning Trees Quickly in Maker-Breaker Games.
SIAM J. Discret. Math., 2015

2014
What is Ramsey-equivalent to a clique?
J. Comb. Theory, Ser. B, 2014

2012
Fast Strategies In Maker-Breaker Games Played on Random Boards.
Comb. Probab. Comput., 2012


  Loading...