Affordable Access

Reducts of the Generalized Random Bipartite Graph

Authors
Type
Preprint
Publication Date
Submission Date
Identifiers
arXiv ID: 1107.3883
Source
arXiv
External links

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments