How to build a barricade

DOI10.1007/BF01637278zbMATH Open0542.52010OpenAlexW1994577906MaRDI QIDQ795340FDOQ795340

Vojtěch Rödl, Peter Frankl, János Pach

Publication date: 1984

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

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

Recommendations

• The densest packing of equal circles into a parallel strip
• scientific article; zbMATH DE number 4019889
• Densest packings of typical convex sets are not lattice-like
• Covering the Plane with Congruent Copies of a Convex Body
• On packings and coverings of unit density

zbMATH Keywords

convex setsindependent random variablesdensest packing

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Noetherian modules and Noetherian injective rings

Cited In (1)

• A `large deviation' phenomenon in discrete geometry. I

This page was built for publication: How to build a barricade

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