Random Subcube Intersection Graphs I: Cliques and Covering
[摘要] We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is no
[发布日期] [发布机构]
[效力级别] [学科分类] 离散数学和组合数学
[关键词] Random graphs;Random intersection graphs [时效性]