Deep cliques in point sets

DOI10.1007/S00454-023-00612-YMaRDI QIDQ6624183zbMATH OpenFDO

Authors Stefan Langerman, Marcelo Mydlarz, Emo Welzl

Publication date 25 October 2024

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

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

• scientific article; zbMATH DE number 3541764 (Why is no real title available?)
• scientific article; zbMATH DE number 2145237 (Why is no real title available?)
• scientific article; zbMATH DE number 2109336 (Why is no real title available?)
• scientific article; zbMATH DE number 3368644 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• A lower bound for the rectilinear crossing number
• Circles through two points that always enclose many points
• Improved bounds for planar k-sets and related problems
• Multidimensional Sorting
• New results on lower bounds for the number of \((\leq k)\)-facets
• On `\(k\)-sets' in the plane
• On halving-edges graphs
• Point sets with many \(k\)-sets
• The number of small semispaces of a finite set of points in the plane
• \(k\)-sets and \(k\)-facets

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)