Random Induced Subgraphs of Generalizedn-Cubes

Advances in Applied Mathematics

Volumn 19, Issue 3, 1997, Pages 360-377

  Reidys, Christian M ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001652579     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1997.0553     Document Type: Article

References (14)

1. Ajtai M., Komlós J., Szemerédi E. Largest random component of ak. Combinatorica. 2:1982;1-7.
2. Aldous D., Diaconis P. Strong uniform times and finite random walks. Adv. in Appl. Math. 2:1987;69-97.
3. Alon N., Spencer J., Erdös P. The Probabilistic Method. Discrete Math. and Optimization Series. 1991;Wiley Interscience, New York.
4. L. Babai, 1991, Local expansion of vertex transitive graphs and random generation in finite groups, Proceedings of the Twenty-Third ACM Symposium on Theory of Computing, 1, 164, 174, ACM Press, New York.
5. Babai L., Sos V. Sidon sets in groups and induced subgraphs of Cayley graphs. European J. Combin. 1:1985;1-11.
6. Bollobás B. Random Graphs. 1985;Academic Press, New York.
7. Chernoff H. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23:1952;493-509.
8. Erdös P., Rényi A. Probabilistic methods in group theory. J. Anal. Math. 14:1965;127-138.
9. L. Harper, Minimal numberings and isoperimetric problems on cubes, Theory of Graphs, International Symposium, Rome, 1996.
10. Harris T. E. The Theory of Branching Processes. 1963;Springer, New York.
11. C. Reidys, 1995, Neutral Networks of RNA Secondary Structures, Math. Faculty, Friedrich Schiller Universität, Jena.
12. C. Reidys, Mapping in random-structures
13. C. Reidys, F. Stadler, P. Schuster, Generic properties of combinatory maps and neutral networks of RNA secondary structures, Bull. Math. Biol. 59, 339, 397.
14. Erdös P., Rényi A. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5:1960;17-61.