Semigrafo (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Semigrafo" in Spanish language version.

refsWebsite

Global rank Spanish rank

451^st place

1,294^th place

2^nd place

69^th place

148^th place

low place

ams.org

Nešetřil, Jaroslav; Shelah, Saharon (2003), «On the order of countable graphs», European Journal of Combinatorics 24 (6): 649-663, MR 1995579, arXiv:math/0404319, doi:10.1016/S0195-6698(03)00064-7 .
Erdős, Paul; Hajnal, András (1985), «Chromatic number of finite and infinite graphs and hypergraphs», Discrete Mathematics 53: 281-285, MR 786496, doi:10.1016/0012-365X(85)90148-7 .. 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, MR 2989432, arXiv:1107.4829, doi:10.1007/s00039-012-0171-x .
Malliaris, M.; Shelah, S. (2014), «Regularity lemmas for stable graphs», Transactions of the American Mathematical Society 366 (3): 1551-1585, MR 3145742, arXiv:1102.3904, doi:10.1090/S0002-9947-2013-05820-5 .
Shelah, S. (1990), Classification theory and the number of nonisomorphic models, Studies in Logic and the Foundations of Mathematics 92 (2nd edición), Amsterdam: North-Holland Publishing Co., pp. 30-31, ISBN 0-444-70260-1, MR 1083551 .

Nešetřil, Jaroslav; Shelah, Saharon (2003), «On the order of countable graphs», European Journal of Combinatorics 24 (6): 649-663, MR 1995579, arXiv:math/0404319, doi:10.1016/S0195-6698(03)00064-7 .
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», Discrete Mathematics 53: 281-285, MR 786496, doi:10.1016/0012-365X(85)90148-7 .. 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, MR 2989432, arXiv:1107.4829, doi:10.1007/s00039-012-0171-x .
Malliaris, M.; Shelah, S. (2014), «Regularity lemmas for stable graphs», Transactions of the American Mathematical Society 366 (3): 1551-1585, MR 3145742, arXiv:1102.3904, doi:10.1090/S0002-9947-2013-05820-5 .

Erdős, Paul; Hajnal, András (1985), «Chromatic number of finite and infinite graphs and hypergraphs», Discrete Mathematics 53: 281-285, MR 786496, doi:10.1016/0012-365X(85)90148-7 .. 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.