3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2022
Many cliques in bounded-degree hypergraphs
Rachel Kirsch, Jamie Radcliffe
Recently Chase determined the maximum possible number of cliques of size in a graph on vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the…
math.CO2022★ 3 cited
Shortened universal cycles for permutations
Rachel Kirsch, Bernard Lidický, Clare Sibley +1
Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to lengt…