最終更新日：2025/12/05
When examining infinite chromatic numbers, the de Bruijn-Erdős theorem assures us that if every finite subgraph can be colored with c colors, then the entire graph can be colored as well.
正解を見る
When examining infinite chromatic numbers, the de Bruijn-Erdős theorem assures us that if every finite subgraph can be colored with c colors, then the entire graph can be colored as well.
音声機能が動作しない場合はこちらをご確認ください
編集履歴（0）
