John Mackey

John Mackey is a Teaching Professor in the Department of Mathematical Sciences at Carnegie Mellon University. His research interests include the exploration of mathematical objects with special properties, such as combinatorial problems involving acquaintances and strangers. He is actively involved in teaching, advising, curriculum development, and mentoring students. Mackey also contributes to outreach efforts and supports initiatives aimed at improving access to mathematics education. His work includes co-authoring publications in journals such as the Journal of Graph Theory and Discrete and Computational Geometry. He is affiliated with the Mellon College of Science and can be contacted via email at jmackey@andrew.cmu.edu or through his departmental website.

John F. Mackey is a Teaching Professor of Computer Science and Mathematics at Carnegie Mellon University, with research interests in Graph Theory, Discrete Math, Combinatorics, Algorithms, and Complexity Theory. His work explores combinatorial structures, Ramsey theory, and automated mathematical discovery. Mackey has contributed to resolving long-standing conjectures, such as Keller’s conjecture, and has investigated problems related to graph saturation, Ramsey numbers, and geometric Ramsey theory. His research also includes algorithmic approaches to minimize geometric configurations and improve bounds on combinatorial problems. His publications highlight the intersection of theoretical computer science and discrete mathematics, emphasizing the role of computational methods in mathematical discovery.