6 citations · 14 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
An Upper bound on the number of Steiner triple systems
Nathan Linial, Zur Luria
Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following…
math.CO2011
An upper bound on the number of high-dimensional permutations
Nathan Linial, Zur Luria
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensiona…