Induced Ramsey-type results and binary predicates for point sets
The electronic journal of combinatorics, Tome 24 (2017) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $k$ and $p$ be positive integers and let $Q$ be a finite point set in general position in the plane. We say that $Q$ is $(k,p)$-Ramsey if there is a finite point set $P$ such that for every $k$-coloring $c$ of $\binom{P}{p}$ there is a subset $Q'$ of $P$ such that $Q'$ and $Q$ have the same order type and $\binom{Q'}{p}$ is monochromatic in $c$. Nešetřil and Valtr proved that for every $k \in \mathbb{N}$, all point sets are $(k,1)$-Ramsey. They also proved that for every $k \ge 2$ and $p \ge 2$, there are point sets that are not $(k,p)$-Ramsey.As our main result, we introduce a new family of $(k,2)$-Ramsey point sets, extending a result of Nešetřil and Valtr. We then use this new result to show that for every $k$ there is a point set $P$ such that no function $\Gamma$ that maps ordered pairs of distinct points from $P$ to a set of size $k$ can satisfy the following "local consistency" property: if $\Gamma$ attains the same values on two ordered triples of points from $P$, then these triples have the same orientation. Intuitively, this implies that there cannot be such a function that is defined locally and determines the orientation of point triples.
DOI : 10.37236/7039
Classification : 05C55, 05D10
Mots-clés : order type, point set, induced Ramsey theorem, point-set predicate

Martin Balko  1   ; Jan Kynčl  2   ; Stefan Langerman  3   ; Alexander Pilz  4

1 Department of Applied Mathematics and Institute for Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic Department of Computer Science, Faculty of Natural Sciences, Ben-Gurion University of the Negev, Beer Sheva, Israel
2 Department of Applied Mathematics and Institute for Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
3 Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium
4 Department of Computer Science, ETH Zürich, Zurich, Switzerland
@article{10_37236_7039,
     author = {Martin Balko and Jan Kyn\v{c}l and Stefan Langerman and Alexander Pilz},
     title = {Induced {Ramsey-type} results and binary predicates for point sets},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {4},
     doi = {10.37236/7039},
     zbl = {1373.05115},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7039/}
}
TY  - JOUR
AU  - Martin Balko
AU  - Jan Kynčl
AU  - Stefan Langerman
AU  - Alexander Pilz
TI  - Induced Ramsey-type results and binary predicates for point sets
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7039/
DO  - 10.37236/7039
ID  - 10_37236_7039
ER  - 
%0 Journal Article
%A Martin Balko
%A Jan Kynčl
%A Stefan Langerman
%A Alexander Pilz
%T Induced Ramsey-type results and binary predicates for point sets
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7039/
%R 10.37236/7039
%F 10_37236_7039
Martin Balko; Jan Kynčl; Stefan Langerman; Alexander Pilz. Induced Ramsey-type results and binary predicates for point sets. The electronic journal of combinatorics, Tome 24 (2017) no. 4. doi: 10.37236/7039

Cité par Sources :