Anita Liebenau

activity

20132025

most citedTowards a characterisation of Sidorenko systems

7 citations · 14 across the 9 of their papers we have counts for

collaborators

19 papers

math.CO2025

An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game

Anita Liebenau, Abdallah Saffidine, Jeffrey Yang

We study the $b$ -biased Oriented-cycle game where two players, OMaker and OBreaker, take turns directing the edges of $K_{n}$ (the complete graph on $n$ vertices). In each round, OMa…

math.CO2024

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 $F$ be a fixed graph and let $G$ be the union of $k$ e…

math.CO2023

Universality for graphs of bounded degeneracy

Peter Allen, Julia Böttcher, Anita Liebenau

Given a family $H$ of graphs, a graph $G$ is called $H$ -universal if $G$ contains every graph of $H$ as a subgraph. Following the extensive research o…

math.CO2021

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens +3

A graph $G$ is said to be $q$ -Ramsey for a $q$ -tuple of graphs $(H_{1}, \dots, H_{q})$ , denoted by $G \to_{q} (H_{1}, \dots, H_{q})$ , if every $q$ -edge-coloring of $G$ contains a monochromatic c…

math.CO2021★ 7 cited

Towards a characterisation of Sidorenko systems

Nina Kamčev, Anita Liebenau, Natasha Morrison

A system of linear forms $L = {L_{1}, \dots, L_{m}}$ over $F_{q}$ is said to be Sidorenko if the number of solutions to $L = 0$ in any $A \subseteq F_{q}^{n}$ is asymptotica…

math.CO2021

On uncommon systems of equations

Nina Kamčev, Anita Liebenau, Natasha Morrison

A system of linear equations $L$ over $F_{q}$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $F_{q}^{n}$ is asymptotically at least t…