Last Updated：2025/12/02
Sentence
Quizzes for review
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.
音声機能が動作しない場合はこちらをご確認ください
Related words
semi-transitive
Adjective
not-comparable
of a graph
Japanese Meaning
グラフ理論において、ある有限な頂点集合が存在し、その有限集合内の各頂点に対して、別の頂点と、その別の頂点から対応する頂点へと写像する単射なホモモルフィズム（グラフの構造を保つ写像）が存在するという性質を持つ状態
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
