Geodesic
The threshold probability for the property of planarity of a random subgraph of a regular graph
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 70 (2015) no. 6, pp. 1170-1172
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_2015_70_6_a5,
     author = {A. V. Burkin},
     title = {The threshold probability for the property of~planarity of a random subgraph of a regular graph},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {1170--1172},
     year = {2015},
     volume = {70},
     number = {6},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2015_70_6_a5/}
}
TY  - JOUR
AU  - A. V. Burkin
TI  - The threshold probability for the property of planarity of a random subgraph of a regular graph
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2015
SP  - 1170
EP  - 1172
VL  - 70
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/RM_2015_70_6_a5/
LA  - en
ID  - RM_2015_70_6_a5
ER  - 
%0 Journal Article
%A A. V. Burkin
%T The threshold probability for the property of planarity of a random subgraph of a regular graph
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2015
%P 1170-1172
%V 70
%N 6
%U http://geodesic.mathdoc.fr/item/RM_2015_70_6_a5/
%G en
%F RM_2015_70_6_a5
A. V. Burkin. The threshold probability for the property of planarity of a random subgraph of a regular graph. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 70 (2015) no. 6, pp. 1170-1172. http://geodesic.mathdoc.fr/item/RM_2015_70_6_a5/

[1] B. Bollobás, Random graphs, Cambridge Stud. Adv. Math., 73, Cambridge Univ. Press, Cambridge, 2001, xviii+498 pp. | DOI | MR | Zbl

[2] S. Janson, T. Łuczak, A. Ruciński, Random graphs, Wiley-Interscience, New York, 2000, xii+333 pp. | DOI | MR | Zbl

[3] V. F. Kolchin, Sluchainye grafy, Fizmatlit, M., 2000, 256 pp. | MR | Zbl

[4] P. Erd{ő}s, A. Rényi, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5 (1960), 17–61 | MR | Zbl

[5] T. Łuczak, J. C. Wierman, Combinatorica, 9:1 (1989), 39–49 | DOI | MR | Zbl

[6] A. Frieze, M. Krivelevich, Combin. Probab. Comput., 22:5 (2013), 722–732 | DOI | MR | Zbl

[7] A. M. Raigorodskii, Dokl. RAN, 371:5 (2000), 600–603 | MR | Zbl

[8] A. M. Raigorodskii, UMN, 56:1(337) (2001), 107–146 | DOI | DOI | MR | Zbl

[9] A. M. Raigorodskii, Matem. sb., 193:10 (2002), 139–160 | DOI | DOI | MR | Zbl

[10] A. M. Raigorodskii, Matem. sb., 196:1 (2005), 123–156 | DOI | DOI | MR | Zbl

[11] A. M. Raigorodskii, Izv. RAN. Ser. matem., 69:3 (2005), 81–108 | DOI | DOI | MR | Zbl

[12] A. M. Raigorodskii, Thirty essays on geometric graph theory, Springer, Berlin, 2013, 429–460 | DOI | MR | Zbl

[13] A. M. Raigorodskii, Combinatorica, 32:1 (2012), 111–123 | DOI | MR | Zbl