Last Updated :2025/11/29

Veblen's theorem

Proper noun
Japanese Meaning
有限グラフの全ての辺が、各頂点の次数が偶数である場合に限り、互いに重ならない単純閉路(サイクル)の集合に分割できるという、グラフ理論における定理。
What is this buttons?

セミナーで彼女は、有限グラフの辺集合が各頂点の次数がすべて偶数であることと同値で互いに素な単純閉路の和集合として表せるという定理を引用して、その分解を示した。

Quizzes for review

(graph theory) A theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree.

音声機能が動作しない場合はこちらをご確認ください
See correct answer

Veblen's theorem

In the seminar, she invoked Veblen's theorem to show that the edges of the network can be partitioned into disjoint simple cycles when every vertex has even degree.

See correct answer

In the seminar, she invoked Veblen's theorem to show that the edges of the network can be partitioned into disjoint simple cycles when every vertex has even degree.

音声機能が動作しない場合はこちらをご確認ください

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
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★