29 citations · 139 across the 27 of their papers we have counts for
1 paper · 1 filter
Denis S. Krotov, Vladimir N. Potapov
By a (latin) unitrade, we call a set of vertices of the Hamming graph that is intersects with every maximal clique in 0 or 2 vertices. A bitrade is a bipartite unitrade, that i…