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
β¦ 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
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
Orders of Induced Subgraphs in Sparse Ra
β
ZBIGNIEW PALKA
π
Article
π
1989
π
John Wiley and Sons
π
English
β 418 KB
Hyper hamiltonian laceability of Cayley
β
Toru Araki
π
Article
π
2006
π
John Wiley and Sons
π
English
β 144 KB
Graphs determined by their finite induce
β
H.D Macpherson
π
Article
π
1986
π
Elsevier Science
π
English
β 271 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