𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random induced subgraphs of Cayley graphs induced by transpositions

✍ Scribed by Emma Yu Jin; Christian M. Reidys


Book ID
113567396
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
372 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Random Subgraphs of Cayley Graphs overp-
✍ C.M. Reidys πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 146 KB

The subject of this paper is the size of the largest component in random subgraphs of Cayley graphs, X n , taken over a class of p-groups, G n . G n consists of p-groups, G n , with the following properties: , where K is some positive constant. We consider Cayley graphs X n = (G n , S n ), where S

Induced Subgraph in Random Regular Graph
✍ Lan XIAO; Guiying YAN; Yuwen WU; Wei REN πŸ“‚ Article πŸ“… 2008 πŸ› Academy of Mathematics and Systems Science, Chines 🌐 English βš– 229 KB
Characterizing path graphs by forbidden
✍ Benjamin LΓ©vΓͺque; FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. Β© 2009