Half graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Half graph" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

5ams.org

451^st place

277^th place

3arxiv.org

69^th place

59^th place

1graphclasses.org

low place

1renyi.hu

low place

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

mathscinet.ams.org

Nešetřil, Jaroslav; Shelah, Saharon (2003), "On the order of countable graphs", European Journal of Combinatorics, 24 (6): 649–663, arXiv:math/0404319, doi:10.1016/S0195-6698(03)00064-7, MR 1995579
Erdős, Paul; Hajnal, András (1985), "Chromatic number of finite and infinite graphs and hypergraphs" (PDF), Discrete Mathematics, 53: 281–285, doi:10.1016/0012-365X(85)90148-7, MR 0786496. The result that graphs of uncountable chromatic number contain an infinite half graph is credited in this paper to Hajnal and cited to a 1973 paper of the same authors with Shelah, but that paper states the result only in the weaker form that graphs of uncountable chromatic number contain complete bipartite graphs where one side is any finite number and the other side is infinite.
Conlon, David; Fox, Jacob (2012), "Bounds for graph regularity and removal lemmas", Geometric and Functional Analysis, 22 (5): 1191–1256, arXiv:1107.4829, doi:10.1007/s00039-012-0171-x, MR 2989432
Malliaris, M.; Shelah, S. (2014), "Regularity lemmas for stable graphs", Transactions of the American Mathematical Society, 366 (3): 1551–1585, arXiv:1102.3904, doi:10.1090/S0002-9947-2013-05820-5, MR 3145742
Shelah, S. (1990), Classification theory and the number of nonisomorphic models, Studies in Logic and the Foundations of Mathematics, vol. 92 (2nd ed.), Amsterdam: North-Holland Publishing Co., pp. 30–31, ISBN 0-444-70260-1, MR 1083551

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

Nešetřil, Jaroslav; Shelah, Saharon (2003), "On the order of countable graphs", European Journal of Combinatorics, 24 (6): 649–663, arXiv:math/0404319, doi:10.1016/S0195-6698(03)00064-7, MR 1995579
Conlon, David; Fox, Jacob (2012), "Bounds for graph regularity and removal lemmas", Geometric and Functional Analysis, 22 (5): 1191–1256, arXiv:1107.4829, doi:10.1007/s00039-012-0171-x, MR 2989432
Malliaris, M.; Shelah, S. (2014), "Regularity lemmas for stable graphs", Transactions of the American Mathematical Society, 366 (3): 1551–1585, arXiv:1102.3904, doi:10.1090/S0002-9947-2013-05820-5, MR 3145742

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

Nešetřil, Jaroslav; Shelah, Saharon (2003), "On the order of countable graphs", European Journal of Combinatorics, 24 (6): 649–663, arXiv:math/0404319, doi:10.1016/S0195-6698(03)00064-7, MR 1995579
Godsil, C. D. (1985), "Inverses of trees", Combinatorica, 5 (1): 33–39, doi:10.1007/bf02579440. See in particular Lemma 2.1.
Erdős, Paul; Hajnal, András (1985), "Chromatic number of finite and infinite graphs and hypergraphs" (PDF), Discrete Mathematics, 53: 281–285, doi:10.1016/0012-365X(85)90148-7, MR 0786496. The result that graphs of uncountable chromatic number contain an infinite half graph is credited in this paper to Hajnal and cited to a 1973 paper of the same authors with Shelah, but that paper states the result only in the weaker form that graphs of uncountable chromatic number contain complete bipartite graphs where one side is any finite number and the other side is infinite.
Conlon, David; Fox, Jacob (2012), "Bounds for graph regularity and removal lemmas", Geometric and Functional Analysis, 22 (5): 1191–1256, arXiv:1107.4829, doi:10.1007/s00039-012-0171-x, MR 2989432
Malliaris, M.; Shelah, S. (2014), "Regularity lemmas for stable graphs", Transactions of the American Mathematical Society, 366 (3): 1551–1585, arXiv:1102.3904, doi:10.1090/S0002-9947-2013-05820-5, MR 3145742
Agrawal, Akanksha; Allumalla, Ravi Kiran; Dhanekula, Varun Teja (2021), "Refuting FPT algorithms for some parameterized problems under Gap-ETH", in Golovach, Petr A.; Zehavi, Meirav (eds.), 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8–10, 2021, Lisbon, Portugal, LIPIcs, vol. 214, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 2:1–2:12, doi:10.4230/LIPIcs.IPEC.2021.2, ISBN 978-3-95977-216-7

graphclasses.org (Global: low place; English: low place)

"Half graphs", Information System on Graph Classes and their Inclusions, retrieved 2023-04-15

renyi.hu (Global: low place; English: low place)

users.renyi.hu

Erdős, Paul; Hajnal, András (1985), "Chromatic number of finite and infinite graphs and hypergraphs" (PDF), Discrete Mathematics, 53: 281–285, doi:10.1016/0012-365X(85)90148-7, MR 0786496. The result that graphs of uncountable chromatic number contain an infinite half graph is credited in this paper to Hajnal and cited to a 1973 paper of the same authors with Shelah, but that paper states the result only in the weaker form that graphs of uncountable chromatic number contain complete bipartite graphs where one side is any finite number and the other side is infinite.