no code implementations • 9 Mar 2021 • Debra Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach
The Mycielskian construction, denoted $\mu(G)$, takes a finite simple graph $G$ to a larger graph with of the same clique number but larger chromatic number.
Combinatorics
no code implementations • 5 Jun 2020 • Debra Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach
The smallest such $d$ is the distinguishing number, $\operatorname{Dist}(G)$.
Combinatorics 05C15, 05C25, 05C69, 05C75
no code implementations • 3 Mar 2016 • Mihai Cucuringu, Charlie Marshak, Dillon Montag, Puck Rombach
In this work, we adapt the rank aggregation framework for the discovery of optimal course sequences at the university level.
