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

2 papers · 1 filter

math.CO2015★ 5 cited

On comparability of bigrassmannian permutations

John Engbers, Adam Hammett

Let $S_{n}$ and $B_{n}$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$ , and let $(S_{n}, \leq)$ denote the Bruha…

math.CO2015

Extremal H-colorings of trees and 2-connected graphs

John Engbers, David Galvin

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$ . $H$ -colorings generalize such notions as independent…