Reducts of the Generalized Random Bipartite Graph

Details Reducts of the Generalized Random Bipartite Graph Reducts of the Generalized Random Bipartite Graph

2011-07-20

arxiv.org/abs/1107.3883v1

Mathematics

Logic

Scientific paper

Let \Gamma be the generalized random bipartite graph that has two sides Rl and Rr with edges for every pair of vertices between R1 and Rr but no edges within each side, where all the edges are randomly colored by three colors P1; P2; P3. In this paper, we investigate the reducts of \Gamma that preserve Rl and Rr, and classify the closed permutation subgroups in Sym(Rl)\timesSym(Rr) containing the group Aut(\Gamma). Our results rely on a combinatorial theorem of Nesetril-Rodl and the strong finite submodel property of the random bipartite graph.

Affiliated with

Also associated with

No associations

Rating

Reducts of the Generalized 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 Generalized Random Bipartite Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducts of the Generalized Random Bipartite Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34315