On non-denumerable graphs
From MaRDI portal
Publication:5842848
DOI10.1090/S0002-9904-1943-07954-2zbMath0063.01275WikidataQ105814903 ScholiaQ105814903MaRDI QIDQ5842848
Publication date: 1943
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Non-repetitive colorings of infinite sets, Monocolored topological complete graphs in colorings of uncountable complete graphs, Partitions of vector spaces, How plausible is the continuum hypothesis?, Infinite Matroids, Avoiding equal distances, Coloring triangles and rectangles, SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS, Unnamed Item, An infinite color analogue of Rado's theorem, Ramsey theory for highly connected monochromatic subgraphs, Erdős-Kakutani phenomena for paths, Avoidable algebraic subsets of Euclidean space, Partitioning Euclidean space, Some algebraic equivalent forms of $\mathbb {R}\subseteq L$, Partition relations for cardinal numbers
