14 citations · 20 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 6 cited
Algorithms for discovering and proving theorems about permutation patterns
Hjalti Magnusson, Henning Ulfarsson
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the…
math.CO2011★ 14 cited
On the Representability of Line Graphs
Sergey Kitaev, Pavel Salimov, Christopher Severs +1
A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y. The m…