6 citations · 10 across the 4 of their papers we have counts for
4 papers
Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs
Mitchell Harris, Thomas Kalinowski
We study the convex hull of the graph of a quadratic function , where the sum is over the edge set of a graph with vertex set $\{1,\dots,n\}…
Toward a Unit Distance Embedding for the Heawood graph
Mitchell A. Harris
The unit distance embeddability of a graph, like planarity, involves a mix of constraints that are combinatorial and geometric. We construct a unit distance embedding for in…
Enumeration Problems Related to Ground Horn Theories
Nachum Dershowitz, Mitchell A. Harris, Guan-Shieng Huang
We investigate the enumeration of varieties of boolean theories related to Horn clauses. We describe a number of combinatorial equivalences among different characterizations and ca…
Sharp Bounds for Bandwidth of Clique Products
Tanya Y. Berger-Wolf, Mitchell A. Harris
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for…