Zobrazeno 1 - 1
of 1
pro vyhledávání: '"graph property with assignment"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 477-492 (2013)
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R i
Externí odkaz:
https://doaj.org/article/ebf3bffa3d424f1782a5bd9f5a3a286f
