Induced Ramsey-type results and binary predicates for point sets
From MaRDI portal
Publication:5915805
DOI10.1016/j.endm.2017.06.023zbMath1378.05205arXiv1705.01909OpenAlexW2916659739MaRDI QIDQ5915805
Alexander Pilz, Stefan Langerman, Jan Kynčl, Martin Balko
Publication date: 18 January 2018
Published in: Electronic Notes in Discrete Mathematics, The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.01909
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple realizability of complete abstract topological graphs in P
- Semispaces of configurations, cell complexes of arrangements
- Realization of abstract convex geometries by point configurations
- Ramsey classes of set systems
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Axioms and hulls
- A Ramsey property of order types
- On the number of arrangements of pseudolines
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Reconstructing Point Set Order Typesfrom Radial Orderings
- Multidimensional Sorting
- The number of polytopes, configurations and real matroids
- A Ramsey-Type Theorem in the Plane
- Convex Polytopes
- From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
- Induced Ramsey-type results and binary predicates for point sets
This page was built for publication: Induced Ramsey-type results and binary predicates for point sets
