Arithmetic subtrees in large subsets of products of trees
From MaRDI portal
Publication:6094777
Abstract: Furstenberg-Weiss have extended Szemer'edi's theorem on arithmetic progressions to trees by showing that a large subset of the tree contains arbitrarily long arithmetic subtrees. We study higher dimensional versions that analogously extend the multidimensional Szemer'edi theorem by demonstrating the existence of certain arithmetic structures in large subsets of a cartesian product of trees.
Recommendations
- Dense Subsets of Products of Finite Trees
- On subtrees of trees
- On the log-product of the subtree-sizes of random trees
- scientific article; zbMATH DE number 5707458
- The large scale geometry of products of trees
- On the domination subdivision numbers of trees
- scientific article; zbMATH DE number 644325
- The arithmetic of trees
Cites work
This page was built for publication: Arithmetic subtrees in large subsets of products of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094777)