Reducts of the random bipartite graph

Details Reducts of the random bipartite graph Reducts of the random bipartite graph

2011-01-10

arxiv.org/abs/1101.1947v2

Mathematics

Logic

Scientific paper

Let $\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\Gamma$ that preserve sides. We classify the closed permutation subgroups containing the group $Aut(\Gamma)^*$, where $Aut(\Gamma)^*$ is the group of all isomorphisms and anti-isomorphisms of $\Gamma$ preserving the two sides. Our results rely on a combinatorial theorem of Ne\v{s}et\v{r}il-R\"{o}dl and a strong finite submodel property for $\Gamma$.

Affiliated with

Also associated with

No associations

Rating

Reducts of the random bipartite graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducts of the random bipartite graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducts of the random bipartite graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152229