Last Updated：2025/12/02
We proved that a semi-transitive graph contains a finite vertex set S such that for every vertex v there exists a vertex s in S and an injective homomorphism of the graph mapping s to v.
See correct answer
We proved that a semi-transitive graph contains a finite vertex set S such that for every vertex v there exists a vertex s in S and an injective homomorphism of the graph mapping s to v.
音声機能が動作しない場合はこちらをご確認ください
Edit Histories（0）
