Dr. John Engbers

Dr. John EngbersMarquette University

Cudahy Hall, 332

MilwaukeeWI53201United States of America(414) 288-6880john.engbers@marquette.eduPersonal Website

Associate Professor, Undergraduate Chair

Department of Mathematical and Statistical Sciences

Courses Taught

• Calculus I
• Foundations of Mathematics

Research Interests

• Graph Theory - Coloring of Graphs
• Combinatorics

Selected Publications

• John Engbers and Aysel Erey, Extremal graphs for average sizes of maximal matchings, Discrete Applied Mathematics 341 (2023), 308-321.
• John Engbers, Aysel Erey, Jacob Fox, and Xiaoyu He, Tomescu’s graph coloring conjecture for l-connected graphs, SIAM Journal of Discrete Mathematics 35(2) (2021), 1478-1502.
• John Engbers, Lauren Keough, and Taylor Short, Independent sets in n-vertex k-chromatic l-connected graphs, Discrete Mathematics 344 (2021), 112376. 10pp.
• John Engbers and Adam Hammett, To replace or not to replace — that is the question, College Mathematics Journal 51(2) (2020), 117-123.
• John Engbers, Jay Pantone, and Christopher Stocker, Colored multipermutations and a combinatorial generalization of Worpitzky’s identity, Australasian Journal of Combinatorics 78(2) (2020), 335-347.

• More..

  • John Engbers and Christopher Stocker. Maximizing and minimizing the number of generalized colorings of trees. Discrete Mathematics 342 (2019), 1048-1055.
  • John Engbers, David Galvin, and Cliff Smyth. Restricted Stirling and Lah number matrices and their inverses. Journal of Combinatorial Theory, Series A 161 (2019), 271-298.
  • John Engbers and Aysel Erey. Extremal colorings and independent sets. Graphs and Combinatorics 34 (2018), 1347-1361.
  • John Engbers. Maximizing H-colorings of connected graphs with fixed minimum degree. J. Graph Theory 85 (2017) 780-787.
  • John Engbers and David Galvin. Extremal H-colorings of trees and 2-connected graphs. J. Comb. Theory Ser.B. 122 (2017) 800-814.   
  • John Engbers and Christopher Stocker. Two combinatorial proofs of identities involving sums of powers of binomial coefficients. Integers. 16 (2016) #A58.
  • John Engbers.Extremal H-colorings of graphs with fixed minimum degree. Journal of Graph Theory 79. (2015): 103-124.
  • John Engbers, David Galvin, and Justin Hilyard. Combinatorially interpreting generalized Stirling numbers. European J. Combin. 43 (2015) 32-54.
  • John Engbersand Adam Hammett. Trivial meet and join within the lattice of monotone triangles. Electronic J. Combin. 21(3) (2014) #P3.13.
  • John Engbersand David Galvin. Counting Independent Sets of a Fixed Size in Graphs with Given Minimum Degree. J. Graph Theory 76 (2014), 149-168.