Search arXivSearch

arXiv · 1009.3683

Ideal games and Ramsey sets

Abstract

It is shown that Matet's characterization of the Ramsey property relative to a selective co-ideal $\mathcal{H}$, in terms of games of Kastanas, still holds if we consider semiselectivity instead of selectivity. Moreover, we prove that a co-ideal $\mathcal{H}$ is semiselective if and only if Matet's game-theoretic characterization of the $\mathcal{H}$-Ramsey property holds. This lifts Kastanas's characterization of the classical Ramsey property to its optimal setting, from the point of view of the local Ramsey theory and gives a game-theoretic counterpart to a theorem of Farah \cite{far}, asserting that a co-ideal $\mathcal{H}$ is semiselective if and only if the family of $\mathcal{H}$-Ramsey subsets of $\N^{[\infty]}$ coincides with the family of those sets having the abstract $\mathcal{H}$-Baire property. Finally, we show that under suitable assumptions, for every semiselective co-ideal $\mathcal H$ all sets of real numbers are $\mathcal H$-Ramsey.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos Di Prisco, Jose G. Mijares, Carlos Uzcategui. 2014-10-16. Ideal games and Ramsey sets. https://arxiv.org/abs/1009.3683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO