Name
Abstract | ||
|---|---|---|
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 non-empty. Our motivation for considering such graphs is to model 'random compatibility' between vertices in a large network. For both of the models considered in this paper, we determine the thresholds for covering the underlying hypercube Q(d) and for the appearance of s-cliques. In addition we pose a number of open problems. |
Year | Venue | Field |
|---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | Random regular graph,Discrete mathematics,Indifference graph,Combinatorics,Random graph,Chordal graph,Clique-sum,Pathwidth,Intersection number (graph theory),Mathematics,Trapezoid graph |
DocType | Volume | Issue |
Journal | 23 | 3 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Victor Falgas-Ravry | 1 | 28 | 7.46 |
| Klas Markström | 2 | 162 | 25.84 |