Dr. Hurlbert works in several areas of combinatorics and graph theory, primarily Universal Cycles (minimal length listings of combinatorial objects),
Graph Pebbling (a network model for resource allocation), and Extremal Set Theory (maximum-sized families of sets under certain restrictions).
Secondary interests include Combinatorial Bijections
(matching equal size sets together), Linear and Combinatorial Optimization
(maximizing linear functions over linear constraints), and Partially
Ordered Set Dimension (embedding ordered structures in Euclidean space).
|
