Jesse Geneson

Papers

Total Citations

H-Index

About

Jesse Geneson’s research lies at the intersection of extremal combinatorics and graph theory, with a particular focus on forbidden patterns and metric dimensions. His work on extremal functions of forbidden multidimensional matrices has advanced the understanding of pattern avoidance in higher dimensions, a problem with deep connections to discrete geometry and computer science. In graph theory, Geneson has made significant contributions to the study of metric dimension—a parameter originally motivated by robot navigation. His 2021 paper “The distance-k dimension of graphs” extends classical metric dimension to a more general distance-based framework, providing new bounds and structural insights. Complementing this, his work “Extremal results for graphs of bounded metric dimension” explores the extremal limits of graphs constrained by this parameter, offering tight results that bridge extremal graph theory and metric geometry. With his most-cited papers accumulating 7, 5, and 4 citations respectively, Geneson’s research is steadily gaining recognition for its originality and depth. His contributions are particularly valuable for researchers interested in forbidden substructures, graph parameters, and the interplay between combinatorial extremal problems and applied contexts like network navigation.