When Do Graph Covers Preserve the Clique Dynamics of Infinite Graphs?
Limbach, A.M., Winter, M. When Do Graph Covers Preserve the Clique Dynamics of Infinite Graphs?. Mat. Contemp. (2025). https://doi.org/10.1007/s44425-025-00021-8
Limbach, A.M., Winter, M. When Do Graph Covers Preserve the Clique Dynamics of Infinite Graphs?. Mat. Contemp. (2025). https://doi.org/10.1007/s44425-025-00021-8
Limbach, A.M., Scheidweiler, R., Triesch, E. Effective Khovanskii, Ehrhart Polytopes, and the Erdős Multiplication Table Problem. Eurocomb (2025).
Hladký, J., Hng, E.K., Limbach, A.M. Graphon branching processes and frational isomorphism. http://dx.doi.org/10.48550/arXiv.2408.02528
Limbach, A.M., Winter, M. Characterising clique convergence for locally cyclic graphs of minimum degree δ ≥ 6. Discrete Mathematics 347 (11), 114144. https://doi.org/10.1016/j.disc.2024.114144
Baumeister, M., Limbach, A.M. Clique dynamics of locally cyclic graphs with δ≥ 6. Discrete Mathematics 345.7 (2022): 112873. https://doi.org/10.1016/j.disc.2022.112873
Limbach, A.M., Scheidweiler, R. A Note on Edge Weightings Inducing Proper Vertex Colorings. Graphs and Combinatorics 34, 1269–1277 (2018). https://doi.org/10.1007/s00373-018-1933-5
For a long version of my cv, see here (last updated December 2024).