Andrzej Dudek

Andrzej Dudek is Professor of Mathematics at Western Michigan University, specializing in extremal and probabilistic combinatorics. His research examines Ramsey theory, random graphs, hypergraph problems, and combinatorial optimization through mathematical analysis. Funded by multiple Simons Foundation and NSA grants, he investigates threshold behaviors in generalized Ramsey numbers and structure emergence in random ordered graphs.

His publications demonstrate consistent focus on bridging extremal combinatorics with probabilistic methods. Recent work establishes new bounds for Erdős-Gyárfás problems, analyzes Hamiltonian cycles in Dirac graphs, and characterizes unavoidable substructures in random matchings. Collaborative projects frequently address Ramsey-type questions at linear and quadratic thresholds.

Supervised four PhD dissertations in combinatorics. Education includes PhD from Emory University (2008) and habilitation from Adam Mickiewicz University (2013). Recognitions include the Open Mind Prize (2010) and solution prize for an Erdős problem (2008). Organizes the Lake Michigan Workshop on Combinatorics and Graph Theory with NSF support.