معرفی
John Mackey is a Teaching Professor in the Department of Computer Science at Carnegie Mellon University, affiliated with the School of Computer Science. His research focuses on combinatorial problems, particularly in Ramsey Theory, graph theory, and discrete mathematics. He investigates mathematical structures like Ramsey numbers, geometric configurations, and tiling conjectures, such as Keller’s conjecture. His work often involves automated reasoning and computational methods to explore extremal cases and bounds in discrete systems.
Notable research interests include minimizing geometric configurations (e.g., pentagons), analyzing directed Ramsey numbers, and variations of combinatorial games like cops and robbers. His publications span over three decades, addressing topics from cube tilings to cycle enumeration in tournaments. Despite extensive contributions, awards or fellowships are not explicitly mentioned in the provided materials.
Mackey’s teaching and research emphasize theoretical foundations, with a particular flair for unresolved problems like the party problem involving 43 guests and no five mutual acquaintances/strangers. His work bridges pure mathematics and computational techniques, aiming to uncover hidden structures through rigorous analysis.
