# Partitioning Subgraphs of Profinite Ordered Graphs

## Abstract

Let K be the class of all inverse limits $$G = {\underleftarrow {\lim }_{n \in \mathbb{N}}}{G_n}$$, where each Gn is a finite ordered graph. GK is universal if every BK embeds continuously into G.

Theorem (1). For every finite ordered graph A there exists a least natural number k(A)≥1 such that for every universal GK, for every finite Baire measurable partition of the set $$\left( \begin{gathered} G \hfill \\ A \hfill \\ \end{gathered} \right)$$ of all copies of A in G, there is a closed copy G′⊆G of G such that $$\left( \begin{gathered} G' \hfill \\ A \hfill \\ \end{gathered} \right)$$ meets at most k(A) parts. In the arrow notation:

$$G \to Baire\left( G \right)_{ < \infty |k\left( A \right)}^A$$

.

Theorem (2). The probability that k(A)=1, for a finite ordered graph A, chosen randomly with uniform probability from all graphs on {0,1,...,n–1}, tends to 1 as n grows to infinity, where k(A) is the number given by Theorem (1).

As a corollary

Theorem (3). The class K with Baire partitions satisfies with high probability the A-partition property for a finite ordered graph A, where the A-partition property is

$$\left( {{\forall _{B \in K}}} \right)\left( {{\exists _{C \in K}}} \right)C \to _{Baire}{\left( B \right)^A}$$

.

This is a preview of subscription content, access via your institution.

## References

1. 

F. Abramson and L. Harrington: Models without indiscernibles, J. Symbolic Logic 43 (1978), 572–600.

2. 

A. Blass: A partition theorem for perfect sets, Proc. Amer. Math. Soc. 82 (1981), 271–277.

3. 

S. Frick: Continuous Ramsey theory in higher dimensions, Dissertation, Freie Universit ät Berlin (2008).

4. 

S. Geschke: Clopen graphs, Fundamenta Mathematicae 220 (2013), 155–189.

5. 

S. Geschke, M. Goldstern and M. Kojman: Continuous Ramsey theory on Polish spaces and covering the plane by functions, Journal of Mathematical Logic, 4 (2004), 109–145.

6. 

S. Geschke and S. Huber: Partitions of closed subgraphs, in preparation.

7. 

S. Geschke, M. Kojman, W. Kubis and R. Schipperus: Convex decompositions in the plane and continuous pair colorings of the irrationals, Israel J. Math. 131 (2002), 285–317.

8. 

R. Graham, B. Rothschild and J. Spencer: Ramsey Theory, second edition, John Wiley & Sons (1990)

9. 

A. Hajnal and P. Komjáth: Embedding graphs into colored graphs, Trans. Amer. Math. Soc. 307 (1988), 395–409.

10. 

J. Halpern and H. Läuchli: A partition theorem, Trans. Amer. Math. Soc. 124 (1966), 360–367.

11. 

A. Kechris: Classical descriptive set theory, Graduate Texts in Mathematics 156, Springer-Verlag (1995)

12. 

A. Kechris, V. Pestov and S. Todorcevic: Fraïsse limits, Ramsey theory, and topological dynamics of automorphism groups, Geom. Funct. Anal. 15 (2005), 106–189.

13. 

J. Nešetřil and V. Rödl: A structural generalization of the Ramsey theorem, Bull. Amer. Math. Soc. 83 (1977), 127–128.

14. 

J. Nešetřil and V. Rödl: Partitions of fintie relational and set systems, J. Comb. Th. A 22 (1977), 289–212.

15. 

J. Nešetřil and V. Rödl: Ramsey Classes of Set Systems, J. Comb. Th. A 34 (1983), 183–201.

16. 

J. Nešetřil: For Graphs There Are Only Four Types of Hereditary Ramsey Classes, J. Comb. Theory. Series B 46 (1989), 127–132.

17. 

M. Pouzet and N. Sauer: Edge partitions of the Rado graph, Combinatorica 16 (4) (1996), 1–16.

18. 

N. Sauer: Coloring subgraphs of the Rado graph, Combinatorica 26 (2006), 231–253.

19. 

Y. Sheu: emphPartition properties and Halpern-Läuchli theorem on the Cmin forcing, Dissertation, University of Florida (2005).

20. 

S. Todorcevic: Introduction to Ramsey Spaces, Annals of Mathematics Studies 174, Princeton University Press 2010.

Download references

## Author information

Authors

### Corresponding author

Correspondence to Stefan Geschke.

## Additional information

Partially supported by a German-Israel Foundation for Scientific Research & development grant. The second author was also supported by the DAAD project 57156702, “Universal profinite graphs”. The last author was also supported by an Israel Science Foundation grant number 1365/14.

## Rights and permissions

Reprints and Permissions