Rado graph
... that no matter how biased a coin one uses, flipping a coin to determine whether each edge is present or absent in a countably infinite graph will always produce the same graph, the Rado graph?
... that no matter how <a href="./Fair_coin" id="mwEF4" rel="mw:WikiLink" title="Fair coin">biased a coin</a> one uses, <a href="./Coin_flipping" id="mwEF8" rel="mw:WikiLink" title="Coin flipping">flipping a coin</a> to determine whether each <a class="mw-redirect" href="./Edge_(graph_theory)" id="mwEGA" rel="mw:WikiLink" title="Edge (graph theory)">edge</a> is present or absent in a <a class="mw-redirect" href="./Countability" id="mwEGE" rel="mw:WikiLink" title="Countability">countably infinite</a> <a class="mw-redirect" href="./Undirected_graph" id="mwEGI" rel="mw:WikiLink" title="Undirected graph">graph</a> will always produce <a href="./Graph_isomorphism" id="mwEGM" rel="mw:WikiLink" title="Graph isomorphism">the same graph</a>, the <b id="mwEGQ"><a href="./Rado_graph" id="mwEGU" rel="mw:WikiLink" title="Rado graph">Rado graph</a></b>?