Andrés Aranda López

Andrés Aranda López is a Postdoctoral Researcher at Dresden University of Technology working under Professor Manuel Bodirsky in discrete mathematics. His research bridges theoretical computer science and advanced combinatorics through rigorous mathematical frameworks.

His primary research focuses on infinite homomorphism-homogeneous relational structures and Ramsey theory, with particular emphasis on graph classification problems. Current projects include developing a comprehensive classification of homomorphism-homogeneous graphs and establishing a Fraïssé theorem for IB/IM-homogeneous structures. This work sits at the intersection of model theory, combinatorics, and structural graph theory, addressing fundamental questions about symmetry and categoricity in infinite structures.

Analysis of recent publications reveals a concentrated research trajectory in homogeneous graph theory since 2018, with significant contributions to independence numbers, morphism-extension classes, and clique-omitting graph properties. His work demonstrates strong international collaboration patterns, particularly with researchers in North America and Europe, reflecting engagement with global research communities in discrete mathematics.

Dr. Aranda López maintains an active research program with regular output in high-impact combinatorics journals. While specific grant details aren't public, his sustained publication record in venues like Journal of Combinatorial Theory suggests ongoing research funding. His collaborative approach indicates opportunities for joint projects with international research groups specializing in model theory and combinatorial structures.