Mia Heissan

Professor, Mathematics and Computer Science


Brownson Hall, 4

Mia Heissan has been a member of the Manhattanville faculty since 2013. Dr. Heissan received her PhD in Mathematics from the University of Rhode Island. Her research interests include graph theory and combinatorics, specifically graph representations, graph colorings, and combinatorial games. Graph theory is the study of mathematical objects (graphs), which consist of vertices (or nodes) connected by edges (or arcs.) If one wishes to examine a problem that entails a network of connected discrete structure, this is a graph theory problem. These problems frequently arise in computer science, and often graph theory is thought to be the theoretical math underlying computer science. It is only natural that Dr. Heissan also teaches not only in the mathematics program but also in the computer science program. In her spare time, Mia enjoys playing competitive pickleball, hiking, camping, cycling, and spending time with her family in Connecticut, Rhode Island, and Missouri.

Advanced Calculus (Real Analysis)
Animations and Game Design
Calculus with Analytic Geometry - Early Transcendentals (I, II, and III)
Discrete Structures
Fundamental Concepts
Graph Theory
Linear Algebra
Mathematics for Liberal Arts (A and B)
Philosophy, BA, Cornell University and Rockhurst College
Mathematics, PhD, University of Rhode Island

On the Erdo-Sos Conjecture for graphs with diameter at most k+1
Congressus, Springer


On the Loebl-Komlos-Sos Conjecture and short caterpillars
Journal of Combinatorial Mathematics and Combinatorial Computing


Separation of Gap Closures
Introduction to Closure Systems (Discrete Mathematics and Its Applications), 1st edition (2016), 264-271, ISBN-13: 978-1439819913


On the Boundedness Character of the System xn+1 = (•1 + γ1yn) / xn and yn+1 = (•2 + β2xn + γ2yn) / (A2 + xn + yn)
Communications in Mathematical Analysis 7 no. 2 (2009) 41-50, ISSN 1938-9787