Structural results for planar sets with many similar subsets

zbMATH Open1075.52009MaRDI QIDQ2567400FDOQ2567400

B. M. Ábrego, György Elekes, Silvia Fernández-Merchant

Publication date: 4 October 2005

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

lattice-like structuressimilar subsets

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cited In (6)

• Geometric pattern matching reduces to \(k\)-SUM
• The density of sets containing large similar copies of finite sets
• Geometric Pattern Matching Reduces to k-SUM.
• On the number of similar instances of a pattern in a finite set
• On the maximum number of translates in a point set
• Almost similar configurations

   Recommendations

• Title not available (Why is that?) 👍 👎
• On the number of similar instances of a pattern in a finite set 👍 👎
• The density of sets containing large similar copies of finite sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Large sets containing copies of small sets 👍 👎

This page was built for publication: Structural results for planar sets with many similar subsets

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