Reducts of the Generalized Random Bipartite Graph
Abstract
Let 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 that preserve Rl and Rr, and classify the closed permutation subgroups in Sym(Rl)×Sym(Rr) containing the group Aut(). Our results rely on a combinatorial theorem of Nesetril-Rodl and the strong finite submodel property of the random bipartite graph.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.