Zarankiewicz problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Zarankiewicz problem" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

11ams.org

451^st place

277^th place

5arxiv.org

69^th place

59^th place

5semanticscholar.org

11^th place

8^th place

1web.archive.org

1^st place

1elte.hu

5,814^th place

7,639^th place

1icm.edu.pl

2,656^th place

5,310^th place

1caltech.edu

887^th place

714^th place

ams.org

mathscinet.ams.org

Bollobás, Béla (2004), "VI.2 Complete subgraphs of r-partite graphs", Extremal Graph Theory, Mineola, NY: Dover Publications Inc., pp. 309–326, MR 2078877. Reprint of 1978 Academic Press edition, MR0506522.
Sierpiński, W. (1951), "Sur un problème concernant un reseau à 36 points", Ann. Soc. Polon. Math., 24: 173–174, MR 0059876.
Kővári, T.; T. Sós, V.; Turán, P. (1954), "On a problem of K. Zarankiewicz" (PDF), Colloquium Math., 3: 50–57, doi:10.4064/cm-3-1-50-57, MR 0065617.
Hyltén-Cavallius, C. (1958), "On a combinatorical problem", Colloquium Mathematicum, 6: 59–65, doi:10.4064/cm-6-1-61-65, MR 0103158. As cited by Bollobás (2004).
Znám, Š. (1963), "On a combinatorical problem of K. Zarankiewicz", Colloquium Mathematicum, 11: 81–84, doi:10.4064/cm-11-1-81-84, MR 0162733. As cited by Bollobás (2004).
Reiman, I. (1958), "Über ein Problem von K. Zarankiewicz", Acta Mathematica Academiae Scientiarum Hungaricae, 9 (3–4): 269–273, doi:10.1007/bf02020254, MR 0101250, S2CID 121692172.
Brown, W. G. (1966), "On graphs that do not contain a Thomsen graph", Canadian Mathematical Bulletin, 9 (3): 281–285, doi:10.4153/CMB-1966-036-2, MR 0200182, S2CID 121306253.
Füredi, Zoltán (1996), "New asymptotics for bipartite Turán numbers", Journal of Combinatorial Theory, Series A, 75 (1): 141–144, doi:10.1006/jcta.1996.0067, MR 1395763.
Kollár, János; Rónyai, Lajos; Szabó, Tibor (1996), "Norm-graphs and bipartite Turán numbers", Combinatorica, 16 (3): 399–406, doi:10.1007/BF01261323, MR 1417348, S2CID 26363618.
Alon, Noga; Rónyai, Lajos; Szabó, Tibor (1999), "Norm-graphs: variations and applications", Journal of Combinatorial Theory, Series B, 76 (2): 280–290, doi:10.1006/jctb.1999.1906, MR 1699238.
Matoušek, Jiří (2002), Lectures on discrete geometry, Graduate Texts in Mathematics, vol. 212, New York: Springer-Verlag, pp. 65–68, doi:10.1007/978-1-4613-0039-7, ISBN 0-387-95373-6, MR 1899299.

arxiv.org

Conlon, David (2021), "Some remarks on the Zarankiewicz problem", Mathematical Proceedings of the Cambridge Philosophical Society, 173: 155–161, arXiv:2007.12816, doi:10.1017/S0305004121000475, S2CID 220793154.
Alon, Noga; Mellinger, Keith E.; Mubayi, Dhruv; Verstraëte, Jacques (2012), "The de Bruijn-Erdős Theorem for Hypergraphs", Des. Codes Cryptogr., 65 (3): 233–245, arXiv:1007.4150, doi:10.1007/s10623-011-9555-4, S2CID 15064936.
Blagojević, Pavle; Bukh, Boris; Karasev, Roman (2013), "Turán numbers for K_s,t-free graphs: topological obstructions and algebraic constructions", Israel Journal of Mathematics, 197: 199–214, arXiv:1108.5254, doi:10.1007/s11856-012-0184-z.
Bukh, Boris (2015), "Random algebraic construction of extremal graphs", Bull. London Math. Soc., 47: 939–945, arXiv:1409.3856.
Bukh, Boris (2021), Extremal graphs without exponentially-small bicliques, arXiv:2107.04167.

caltech.edu

authors.library.caltech.edu

Conlon, David (2021), "Some remarks on the Zarankiewicz problem", Mathematical Proceedings of the Cambridge Philosophical Society, 173: 155–161, arXiv:2007.12816, doi:10.1017/S0305004121000475, S2CID 220793154.

doi.org

Kővári, T.; T. Sós, V.; Turán, P. (1954), "On a problem of K. Zarankiewicz" (PDF), Colloquium Math., 3: 50–57, doi:10.4064/cm-3-1-50-57, MR 0065617.
Hyltén-Cavallius, C. (1958), "On a combinatorical problem", Colloquium Mathematicum, 6: 59–65, doi:10.4064/cm-6-1-61-65, MR 0103158. As cited by Bollobás (2004).
Znám, Š. (1963), "On a combinatorical problem of K. Zarankiewicz", Colloquium Mathematicum, 11: 81–84, doi:10.4064/cm-11-1-81-84, MR 0162733. As cited by Bollobás (2004).
Conlon, David (2021), "Some remarks on the Zarankiewicz problem", Mathematical Proceedings of the Cambridge Philosophical Society, 173: 155–161, arXiv:2007.12816, doi:10.1017/S0305004121000475, S2CID 220793154.
Reiman, I. (1958), "Über ein Problem von K. Zarankiewicz", Acta Mathematica Academiae Scientiarum Hungaricae, 9 (3–4): 269–273, doi:10.1007/bf02020254, MR 0101250, S2CID 121692172.
Brown, W. G. (1966), "On graphs that do not contain a Thomsen graph", Canadian Mathematical Bulletin, 9 (3): 281–285, doi:10.4153/CMB-1966-036-2, MR 0200182, S2CID 121306253.
Füredi, Zoltán (1996), "New asymptotics for bipartite Turán numbers", Journal of Combinatorial Theory, Series A, 75 (1): 141–144, doi:10.1006/jcta.1996.0067, MR 1395763.
Kollár, János; Rónyai, Lajos; Szabó, Tibor (1996), "Norm-graphs and bipartite Turán numbers", Combinatorica, 16 (3): 399–406, doi:10.1007/BF01261323, MR 1417348, S2CID 26363618.
Alon, Noga; Rónyai, Lajos; Szabó, Tibor (1999), "Norm-graphs: variations and applications", Journal of Combinatorial Theory, Series B, 76 (2): 280–290, doi:10.1006/jctb.1999.1906, MR 1699238.
Alon, Noga; Mellinger, Keith E.; Mubayi, Dhruv; Verstraëte, Jacques (2012), "The de Bruijn-Erdős Theorem for Hypergraphs", Des. Codes Cryptogr., 65 (3): 233–245, arXiv:1007.4150, doi:10.1007/s10623-011-9555-4, S2CID 15064936.
Blagojević, Pavle; Bukh, Boris; Karasev, Roman (2013), "Turán numbers for K_s,t-free graphs: topological obstructions and algebraic constructions", Israel Journal of Mathematics, 197: 199–214, arXiv:1108.5254, doi:10.1007/s11856-012-0184-z.
Matoušek, Jiří (2002), Lectures on discrete geometry, Graduate Texts in Mathematics, vol. 212, New York: Springer-Verlag, pp. 65–68, doi:10.1007/978-1-4613-0039-7, ISBN 0-387-95373-6, MR 1899299.

elte.hu

cs.elte.hu

"Archived copy" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2014-09-16.{{cite web}}: CS1 maint: archived copy as title (link)

icm.edu.pl

matwbn.icm.edu.pl

Kővári, T.; T. Sós, V.; Turán, P. (1954), "On a problem of K. Zarankiewicz" (PDF), Colloquium Math., 3: 50–57, doi:10.4064/cm-3-1-50-57, MR 0065617.

semanticscholar.org

api.semanticscholar.org

Conlon, David (2021), "Some remarks on the Zarankiewicz problem", Mathematical Proceedings of the Cambridge Philosophical Society, 173: 155–161, arXiv:2007.12816, doi:10.1017/S0305004121000475, S2CID 220793154.
Reiman, I. (1958), "Über ein Problem von K. Zarankiewicz", Acta Mathematica Academiae Scientiarum Hungaricae, 9 (3–4): 269–273, doi:10.1007/bf02020254, MR 0101250, S2CID 121692172.
Brown, W. G. (1966), "On graphs that do not contain a Thomsen graph", Canadian Mathematical Bulletin, 9 (3): 281–285, doi:10.4153/CMB-1966-036-2, MR 0200182, S2CID 121306253.
Kollár, János; Rónyai, Lajos; Szabó, Tibor (1996), "Norm-graphs and bipartite Turán numbers", Combinatorica, 16 (3): 399–406, doi:10.1007/BF01261323, MR 1417348, S2CID 26363618.
Alon, Noga; Mellinger, Keith E.; Mubayi, Dhruv; Verstraëte, Jacques (2012), "The de Bruijn-Erdős Theorem for Hypergraphs", Des. Codes Cryptogr., 65 (3): 233–245, arXiv:1007.4150, doi:10.1007/s10623-011-9555-4, S2CID 15064936.

web.archive.org

"Archived copy" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2014-09-16.{{cite web}}: CS1 maint: archived copy as title (link)