On a problem of Erdős on fractal combinatorial geometry

DOI10.1016/0097-3165(92)90106-5zbMATH Open0749.52013OpenAlexW1966818291MaRDI QIDQ1185892

Kenneth Falconer

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90106-5

zbMATH Keywords

triangleErdős problemvertex set

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Hausdorff dimension and capacities of intersections of sets in n-space
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (10)

A note on Hajłasz-Sobolev spaces on fractals ⋮ How large dimension guarantees a given angle? ⋮ Avoiding right angles and certain Hamming distances ⋮ Large dimensional sets not containing a given angle ⋮ Nonlinear diffusion equations on unbounded fractal domains ⋮ Sets of large dimension not containing polynomial configurations ⋮ Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles ⋮ Small sets containing any pattern ⋮ Large Sets Avoiding Rough Patterns ⋮ Large sets avoiding linear patterns

This page was built for publication: On a problem of Erdős on fractal combinatorial geometry