My research interests lie in combinatorics and graph theory, with results and on-going projects in computational complexity, finite set systems and posets, extremal problems on trees, graph games, graph products, and network modeling. I am particularly enticed by projects motivated by applications in mathematics and other sciences.
Publications
6. I. Miklós and H. Smith. "Complexity Results for the Single Cut-or-Join Model,"
In preparation.
5. S. Behrens, F. Kenter, T. Mahoney, K. Monfared, K. Nowak, H. Smith, and M. Young. "Lower Bounds on the Zero Forcing Number of Graphs,"
In preparation.
4. H. Smith, L. A. Székely, H. Wang, and S. Yuan. "Different Middle Parts of Trees,"
In preparation.
3. H. Smith, L. A. Székely, and H. Wang. "
Eccentricity in Trees,"
arXiv:1408.5865, submitted to the Electronic Journal of Combinatorics, 2014.
2. H. Smith and L. A. Székely "Some Remarks on Baranyai's Theorem,"
Congressus Numerantium, to appear, 2014.
1. R. Hammack and H. Smith. "
Zero Divisors among Digraphs,"
Graphs and Combinatorics 30.1, (2014): 171-181. (
Published on-line DOI:10.1007/s00373-012-1248-x, 2012)
