How can the set of all graphs be the same size as its power set? – math.stackexchange.com

Supose a set $G$ containing all graphs, either finite or infinite. If I take a set $S\in P(G)$ and draw all the graphs in $S$ on a paper I can always just combine them and create one posibly ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Artikel Terkait

0 Comment to "How can the set of all graphs be the same size as its power set? – math.stackexchange.com"