Deep cliques in point sets

DOI10.1007/S00454-023-00612-YMaRDI QIDQ6624183FDOQ6624183

Authors: Stefan Langerman, Marcelo Mydlarz, Emo Welzl 

Publication date: 25 October 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Recommendations

• Point sets with many \(k\)-sets
• Points with large quadrant-depth
• Points with large quadrant depth
• Dense point sets with many halving lines
• On a problem about quadrant-depth

zbMATH Keywords

\(k\)-degenerate graphs\(k\)-setscliquesTukey depthhalving linesdepth measures\(j\)-facets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Title not available (Why is that?)
• Improved bounds for planar \(k\)-sets and related problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multidimensional Sorting
• Title not available (Why is that?)
• Point sets with many \(k\)-sets
• A lower bound for the rectilinear crossing number
• On `\(k\)-sets' in the plane
• \(k\)-sets and \(k\)-facets
• The number of small semispaces of a finite set of points in the plane
• Circles through two points that always enclose many points
• New results on lower bounds for the number of \((\leq k)\)-facets
• On halving-edges graphs

This page was built for publication: Deep cliques in point sets

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