The thinnest holding-lattice of a set

DOI10.1007/BF01364338zbMATH Open0624.52007OpenAlexW1979943943MaRDI QIDQ578593FDOQ578593

Károly Bezdek

Publication date: 1987

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178324

zbMATH Keywords

densityregular triangle-latticethinnest holding-lattice

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• Title not available (Why is that?)

   Recommendations

• Thin set versions of Hindman's theorem 👍 👎
• On thin, very thin, and slim dense sets 👍 👎
• The size of some classes of thin sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The lattice of embedded subsets 👍 👎
• Set-theoretic reducibilities with respect to a lattice of sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Hölder coverings of sets of small dimension 👍 👎

This page was built for publication: The thinnest holding-lattice of a set

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