J. Engbers

activity

20112023

most citedOn comparability of bigrassmannian permutations

5 citations · 9 across the 14 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013★ 3 cited

Combinatorially interpreting generalized Stirling numbers

John Engbers, David Galvin, Justin Hilyard

Let $w$ be a word in alphabet ${x, D}$ with $m$ $x$ 's and $n$ $D$ 's. Interpreting " $x$ " as multiplication by $x$ , and " $D$ " as differentiation with respect to $x$ , the identity $w…

math.CO2013

Extremal H-colorings of graphs with fixed minimum degree

John Engbers

For graphs $G$ and $H$ , a homomorphism from $G$ to $H$ , or $H$ -coloring of $G$ , is a map from the vertices of $G$ to the vertices of $H$ that preserves adjacency. When $H$ is compo…