On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs

DOI10.1007/s11856-009-0076-zzbMath1178.52013arXiv0707.0311OpenAlexW1983962689MaRDI QIDQ731372

Rom Pinchasi, Günter Rote

Publication date: 2 October 2009

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.0311

zbMATH Keywords

antichainlinearly separable sets

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Configuration theorems in linear incidence geometry (51A20)

Related Items

Separation by convex pseudo-circles

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial representation and convex dimension of convex geometries
• Improved bounds for planar \(k\)-sets and related problems
• Long monotone paths in line arrangements
• On the decomposition ofkn into complete bipartite graphs
• Point sets with many \(k\)-sets