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 2016Show all

2 papers · 1 filter

math.CO2016

Restricted Stirling and Lah number matrices and their inverses

John Engbers, David Galvin, Clifford Smyth

Given $R \subseteq N$ let ${k n}_{R}$ , $[k n]_{R}$ , and $L (n, k)_{R}$ be the number of ways of partitioning the set $[n]$ into $k$ non-empty subsets, cycles and lis…

math.CO2016

Maximizing $H$ -colorings of connected graphs with fixed minimum degree

John Engbers

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ that preserves edge adjacency. We consider the following extremal enumerativ…

Restricted Stirling and Lah number matrices and their inverses

Maximizing H-colorings of connected graphs with fixed minimum degree

Maximizing $H$ -colorings of connected graphs with fixed minimum degree