Frankl–Rödl graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Frankl–Rödl graph" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

4ams.org

451^st place

277^th place

2arxiv.org

69^th place

59^th place

1jstor.org

26^th place

20^th place

1toronto.edu

low place

8,821^st place

1acm.org

1,185^th place

840^th place

1archive.org

6^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Charikar, Moses (2002), "On semidefinite programming relaxations for graph coloring and vertex cover", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, pp. 616–620, ISBN 978-0-89871-513-2.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Frankl, Peter; Rödl, Vojtěch (1987), "Forbidden intersections", Transactions of the American Mathematical Society, 300 (1): 259–286, doi:10.2307/2000598, JSTOR 2000598, MR 0871675.
See also Georgiou, Konstantinos; Magen, Avner; Pitassi, Toniann; Tourlakis, Iannis (2010), "Integrality gaps of $2 - o (1)$ for vertex cover SDPs in the Lovász–Schrijver hierarchy" (PDF), SIAM Journal on Computing, 39 (8): 3553–3570, doi:10.1137/080721479, MR 2745765.
Karger, David; Motwani, Rajeev; Sudan, Madhu (1998), "Approximate graph coloring by semidefinite programming", Journal of the ACM, 45 (2): 246–265, arXiv:cs/9812008, doi:10.1145/274787.274791, MR 1623197.
Kleinberg, Jon; Goemans, Michel X. (1998), "The Lovász theta function and a semidefinite programming relaxation of vertex cover", SIAM Journal on Discrete Mathematics, 11 (2): 196–204, doi:10.1137/S0895480195287541, MR 1617152.

archive.org (Global: 6^th place; English: 6^th place)

Charikar, Moses (2002), "On semidefinite programming relaxations for graph coloring and vertex cover", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, pp. 616–620, ISBN 978-0-89871-513-2.

arxiv.org (Global: 69^th place; English: 59^th place)

Tan, Li-Yang; Zhou, Yuan; O'Donnell, Ryan; Kauers, Manuel (2016), "Hypercontractive inequalities via SOS, and the Frankl–Rödl graph", Discrete Analysis, 2016 (4): 20pp, arXiv:1212.5324, doi:10.19086/da.612.
Karger, David; Motwani, Rajeev; Sudan, Madhu (1998), "Approximate graph coloring by semidefinite programming", Journal of the ACM, 45 (2): 246–265, arXiv:cs/9812008, doi:10.1145/274787.274791, MR 1623197.

doi.org (Global: 2^nd place; English: 2^nd place)

Frankl, Peter; Rödl, Vojtěch (1987), "Forbidden intersections", Transactions of the American Mathematical Society, 300 (1): 259–286, doi:10.2307/2000598, JSTOR 2000598, MR 0871675.
Tan, Li-Yang; Zhou, Yuan; O'Donnell, Ryan; Kauers, Manuel (2016), "Hypercontractive inequalities via SOS, and the Frankl–Rödl graph", Discrete Analysis, 2016 (4): 20pp, arXiv:1212.5324, doi:10.19086/da.612.
See also Georgiou, Konstantinos; Magen, Avner; Pitassi, Toniann; Tourlakis, Iannis (2010), "Integrality gaps of $2 - o (1)$ for vertex cover SDPs in the Lovász–Schrijver hierarchy" (PDF), SIAM Journal on Computing, 39 (8): 3553–3570, doi:10.1137/080721479, MR 2745765.
Karger, David; Motwani, Rajeev; Sudan, Madhu (1998), "Approximate graph coloring by semidefinite programming", Journal of the ACM, 45 (2): 246–265, arXiv:cs/9812008, doi:10.1145/274787.274791, MR 1623197.
Kleinberg, Jon; Goemans, Michel X. (1998), "The Lovász theta function and a semidefinite programming relaxation of vertex cover", SIAM Journal on Discrete Mathematics, 11 (2): 196–204, doi:10.1137/S0895480195287541, MR 1617152.

jstor.org (Global: 26^th place; English: 20^th place)

Frankl, Peter; Rödl, Vojtěch (1987), "Forbidden intersections", Transactions of the American Mathematical Society, 300 (1): 259–286, doi:10.2307/2000598, JSTOR 2000598, MR 0871675.

toronto.edu (Global: low place; English: 8,821^st place)

cs.toronto.edu

See also Georgiou, Konstantinos; Magen, Avner; Pitassi, Toniann; Tourlakis, Iannis (2010), "Integrality gaps of $2 - o (1)$ for vertex cover SDPs in the Lovász–Schrijver hierarchy" (PDF), SIAM Journal on Computing, 39 (8): 3553–3570, doi:10.1137/080721479, MR 2745765.

Frankl–Rödl graph (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

jstor.org (Global: 26th place; English: 20th place)

toronto.edu (Global: low place; English: 8,821st place)