On non-denumerable graphs

DOI10.1090/S0002-9904-1943-07954-2MaRDI QIDQ5842848zbMATH OpenWikidataFDO

Authors Shizuo Kakutani, P. Erdős

Publication date 1943

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1943-07954-2

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(23)

• Partitions of vector spaces
• The level of nonmultiplicativity of graphs
• Non-repetitive colorings of infinite sets
• Ramsey theory for highly connected monochromatic subgraphs
• Erdős-Kakutani phenomena for paths
• How plausible is the continuum hypothesis?
• An infinite color analogue of Rado's theorem
• Avoiding equal distances
• scientific article; zbMATH DE number 3880746 (Why is no real title available?)
• scientific article; zbMATH DE number 7449540 (Why is no real title available?)
• On \({\mathcal N}\)-graphs
• SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS
• Avoidable algebraic subsets of Euclidean space
• Truly non-trivial graphoidal graphs
• Some algebraic equivalent forms of $\mathbb {R}\subseteq L$
• scientific article; zbMATH DE number 6438262 (Why is no real title available?)
• Partition relations for cardinal numbers
• On Graphs that do not Contain a Thomsen Graph
• Infinite Matroids
• Partitioning Euclidean space
• Coloring triangles and rectangles
• Coloring isosceles triangles in choiceless set theory
• Monocolored topological complete graphs in colorings of uncountable complete graphs

This page was built for publication: On non-denumerable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5842848)