Packing a Square Lattice with a Rectangle-Free Set of Points

DOI10.2307/2689345MaRDI QIDQ3831587zbMATH OpenOpenAlexFDO

Authors N. S. Mendelsohn

Publication date 1987

Full work available at URL https://doi.org/10.2307/2689345

zbMATH Keywords

finite projective planeslattice point problems

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Cited in

(3)

• Valid constraints for the Point Packing in a Square problem
• Equal entries in totally positive matrices
• THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD

This page was built for publication: Packing a Square Lattice with a Rectangle-Free Set of Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831587)