Graham–Pollak theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graham–Pollak theorem" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

9ams.org

451^st place

277^th place

4arxiv.org

69^th place

59^th place

1psu.edu

207^th place

136^th place

ams.org

mathscinet.ams.org

Graham, R. L.; Pollak, H. O. (1971), "On the addressing problem for loop switching", The Bell System Technical Journal, 50 (8): 2495–2519, doi:10.1002/j.1538-7305.1971.tb02618.x, MR 0289210
Graham, R. L.; Pollak, H. O. (1972), "On embedding graphs in squashed cubes", Graph theory and applications (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., 1972; dedicated to the memory of J. W. T. Youngs), Lecture Notes in Mathematics, vol. 303, pp. 99–110, MR 0332576
Tverberg, H. (1982), "On the decomposition of $K_{n}$ into complete bipartite graphs", Journal of Graph Theory, 6 (4): 493–494, doi:10.1002/jgt.3190060414, MR 0679606
Peck, G. W. (1984), "A new proof of a theorem of Graham and Pollak", Discrete Mathematics, 49 (3): 327–328, doi:10.1016/0012-365X(84)90174-2, MR 0743808
Cioabă, Sebastian M.; Tait, Michael (2013), "Variations on a theme of Graham and Pollak", Discrete Mathematics, 313 (5): 665–676, CiteSeerX 10.1.1.717.6351, doi:10.1016/j.disc.2012.12.001, MR 3009433
Vishwanathan, Sundar (2013), "A counting proof of the Graham-Pollak theorem", Discrete Mathematics, 313 (6): 765–766, arXiv:1007.1553, doi:10.1016/j.disc.2012.12.017, MR 3010739
Leader, Imre; Tan, Ta Sheng (2018), "Improved bounds for the Graham-Pollak problem for hypergraphs", Electronic Journal of Combinatorics, 25 (1): Paper No. 1.4, arXiv:1708.01898, doi:10.37236/7206, MR 3761918
Huang, Hao; Sudakov, Benny (2012), "A counterexample to the Alon–Saks–Seymour conjecture and related problems", Combinatorica, 32 (2): 205–219, arXiv:1002.4687, doi:10.1007/s00493-012-2746-4, MR 2927639
Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan (2009), "Covering graphs with few complete bipartite subgraphs", Theoretical Computer Science, 410 (21–23): 2045–2053, doi:10.1016/j.tcs.2008.12.059, MR 2519293

arxiv.org

Vishwanathan, Sundar (2013), "A counting proof of the Graham-Pollak theorem", Discrete Mathematics, 313 (6): 765–766, arXiv:1007.1553, doi:10.1016/j.disc.2012.12.017, MR 3010739
Leader, Imre; Tan, Ta Sheng (2018), "Improved bounds for the Graham-Pollak problem for hypergraphs", Electronic Journal of Combinatorics, 25 (1): Paper No. 1.4, arXiv:1708.01898, doi:10.37236/7206, MR 3761918
Huang, Hao; Sudakov, Benny (2012), "A counterexample to the Alon–Saks–Seymour conjecture and related problems", Combinatorica, 32 (2): 205–219, arXiv:1002.4687, doi:10.1007/s00493-012-2746-4, MR 2927639
Balodis, Kaspars; Ben-David, Shalev; Göös, Mika; Jain, Siddhartha; Kothari, Robin (2021), "Unambiguous DNFs and Alon–Saks–Seymour", 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 116–124, arXiv:2102.08348, doi:10.1109/FOCS52979.2021.00020, ISBN 978-1-6654-2055-6

doi.org

Aigner, Martin; Ziegler, Günter M. (2018), Proofs from THE BOOK (6th ed.), Springer, pp. 79–80, doi:10.1007/978-3-662-57265-8, ISBN 978-3-662-57265-8
Graham, R. L.; Pollak, H. O. (1971), "On the addressing problem for loop switching", The Bell System Technical Journal, 50 (8): 2495–2519, doi:10.1002/j.1538-7305.1971.tb02618.x, MR 0289210
Tverberg, H. (1982), "On the decomposition of $K_{n}$ into complete bipartite graphs", Journal of Graph Theory, 6 (4): 493–494, doi:10.1002/jgt.3190060414, MR 0679606
Peck, G. W. (1984), "A new proof of a theorem of Graham and Pollak", Discrete Mathematics, 49 (3): 327–328, doi:10.1016/0012-365X(84)90174-2, MR 0743808
Cioabă, Sebastian M.; Tait, Michael (2013), "Variations on a theme of Graham and Pollak", Discrete Mathematics, 313 (5): 665–676, CiteSeerX 10.1.1.717.6351, doi:10.1016/j.disc.2012.12.001, MR 3009433
Vishwanathan, Sundar (2013), "A counting proof of the Graham-Pollak theorem", Discrete Mathematics, 313 (6): 765–766, arXiv:1007.1553, doi:10.1016/j.disc.2012.12.017, MR 3010739
Leader, Imre; Tan, Ta Sheng (2018), "Improved bounds for the Graham-Pollak problem for hypergraphs", Electronic Journal of Combinatorics, 25 (1): Paper No. 1.4, arXiv:1708.01898, doi:10.37236/7206, MR 3761918
Huang, Hao; Sudakov, Benny (2012), "A counterexample to the Alon–Saks–Seymour conjecture and related problems", Combinatorica, 32 (2): 205–219, arXiv:1002.4687, doi:10.1007/s00493-012-2746-4, MR 2927639
Balodis, Kaspars; Ben-David, Shalev; Göös, Mika; Jain, Siddhartha; Kothari, Robin (2021), "Unambiguous DNFs and Alon–Saks–Seymour", 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 116–124, arXiv:2102.08348, doi:10.1109/FOCS52979.2021.00020, ISBN 978-1-6654-2055-6
Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan (2009), "Covering graphs with few complete bipartite subgraphs", Theoretical Computer Science, 410 (21–23): 2045–2053, doi:10.1016/j.tcs.2008.12.059, MR 2519293
Chandran, Sunil; Issac, Davis; Karrenbauer, Andreas (2017), "On the parameterized complexity of biclique cover and partition", in Guo, Jiong; Hermelin, Danny (eds.), 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 63, Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 11:1–11:13, doi:10.4230/LIPIcs.IPEC.2016.11, ISBN 978-3-95977-023-1

psu.edu

citeseerx.ist.psu.edu

Cioabă, Sebastian M.; Tait, Michael (2013), "Variations on a theme of Graham and Pollak", Discrete Mathematics, 313 (5): 665–676, CiteSeerX 10.1.1.717.6351, doi:10.1016/j.disc.2012.12.001, MR 3009433