# Actions of Thompson group F. II

Let $\Gamma$ be a group generated by symmetric finite set $S$ and acting on $X$. The Schreier graph of the action is the graph with vertex set $X$ and $(x,y)$ is an edge if there is $s\in S$ such that $x=sy$.

Does there exists a faithful transitive action of the Thompson group F on a discrete set $X$ such that the Schreier graph of this action do not contain a binary tree?

-
What do you mean by contain"? As a subgraph or coarsely embedded? –  Mark Sapir May 10 '13 at 1:06
For the applications the best would be to know that it does not coarsely contain. But firstly, I want to know about containment as a subgraph only (I suspect that there is no such action). –  Kate Juschenko May 10 '13 at 1:30
The subgraph interpretation is more difficult because that depends on the generating set. –  Mark Sapir May 10 '13 at 2:33
I am thinking about "avoiding" of the free semigroup and this can not be done for known to me actions. But yes, you are right for the general situation. –  Kate Juschenko May 10 '13 at 3:15
Free subsemigroups don't give you trees as subgraphs, only coarsely embedded trees. –  Mark Sapir May 10 '13 at 7:00