全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2011 

Reducts of the Generalized Random Bipartite Graph

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133