Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles
From MaRDI portal
Publication:1379135
zbMath0887.05011MaRDI QIDQ1379135
Brendan D. McKay, Ian M. Wanless
Publication date: 18 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119365
Determinants, permanents, traces, other special matrix functions (15A15) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matrices of integers (15B36)
Related Items
Matchings in regular graphs: minimizing the partition function ⋮ On connection between reducibility of an \(n\)-ary quasigroup and that of its retracts. ⋮ A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). ⋮ An update on Minc's survey of open problems involving permanents ⋮ Random strongly regular graphs? ⋮ Constructions of transitive Latin hypercubeatin hypercubes ⋮ Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
This page was built for publication: Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles
