3 papers
math.CO2022★ 2 cited
The Clique Structure of Johnson Graphs
Pavel Shuldiner, R. Wayne Oldford
Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of Johnson…
math.CO2022
How many cliques can a clique cover cover?
Pavel Shuldiner, R. Wayne Oldford
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques…
math.CO2017
Characterizing the number of coloured -ary partitions modulo , with and without gaps
I. P. Goulden, Pavel Shuldiner
In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of -ary partitions modulo , with and without gaps. In this paper…