Wednesday, April 16, 2014
NEW WILMINGTON, Pa. - Dr. David Offner, assistant professor of mathematics, published "Packing the Hypercube" in Discussiones Mathematicae Graph Theory Vol. 34, No. 1, published January 2014.
The article discussed the following question: Let G be a graph that is a subgraph of some n-dimensional hypercube . For sufficiently large n, Quentin Stout proved that it is possible to pack vertex-disjoint copies of G in so that any proportion r < 1 of the vertices of are covered by the packing. The paper proves an analogous theorem for edge-disjoint packings: For sufficiently large n, it is possible to pack edge-disjoint copies of G in so that any proportion r < 1 of the edges of are covered by the packing.
Offner, who joined the Westminster faculty in 2009, earned an undergraduate degree from Yale University and a Ph.D. from Carnegie Mellon University. His research interests include probabilistic and extremal combinatorics, in particular problems on the family of hypercube graphs.
Contact Offner at 724-946-7293 or email for more information.