12 citations · 50 across the 21 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
The number of Hamiltonian decompositions of regular graphs
Roman Glebov, Zur Luria, Benny Sudakov
A Hamilton cycle in a graph is a cycle passing through every vertex of . A Hamiltonian decomposition of is a partition of its edge set into disjoint Hamilton cycles. One…
math.CO2015★ 3 cited
On the maximum number of Latin transversals
Roman Glebov, Zur Luria
Let denote the maximal number of transversals in an order- Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left…