Anna M. Limbach

activity

20212026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

Effective Khovanskii, Ehrhart Polytopes, and the Erdős Multiplication Table Problem

Anna Margarethe Limbach, Robert Scheidweiler, Eberhard Triesch

Let $P (k, n)$ be the set of products of $k$ factors from the set ${1, \dots, n} .$ In 1955, Erdős posed the problem of determining the order of magnitude of $∣ P (2, n) ∣$ and prove…

math.CO2025

When do graph covers preserve the clique dynamics of infinite graphs?

Anna M. Limbach, Martin Winter

We investigate for which classes of (potentially infinite) graphs the clique dynamics is cover stable, i. e., when clique convergence/divergence is preserved under triangular cover…

math.CO2024

Graphon branching processes and fractional isomorphism

Jan Hladký, Eng Keat Hng, Anna Margarethe Limbach

In their study of the giant component in inhomogeneous random graphs, Bollobás, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded g…

math.CO2023

Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree $δ \geq 6$

Anna M. Limbach, Martin Winter

The clique graph $k G$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$ , two of which are adjacent in $k G$ if they have non-empty intersection in $…

math.CO2021

Clique dynamics of locally cyclic graphs with $δ \geq 6$

Markus Baumeister, Anna M. Limbach

We prove that the clique graph operator $k$ is divergent on a locally cyclic graph $G$ (i.e. $N_{G} (v)$ is a circle) with minimum degree $δ (G) = 6$ if and only if $G$ is $6$ -regular. T…