Last Updated :2025/12/07

Keller graph

Noun
Japanese Meaning
幾何学において、ケラーの予想に関連するグラフの族の一つ。具体的には、次元 n のケラーグラフは 4ⁿ 個の頂点から構成され、各頂点は n 個の値 (m₁, …, mₙ) を持ち、各 m は 0, 1, 2, 3 のいずれかの値をとる。また、2 つの頂点が辺で結ばれる条件は、少なくとも2つの座標において値が異なり、そのうち少なくとも1つの座標で値の差がちょうど2である場合に成立する。
What is this buttons?

ケラーの予想に関連するグラフの隣接規則を調べることで、研究者は次元nにおけるケラーの予想に関連する配置を系統的に検証することができます。

plural

Quizzes for review

(geometry) Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate.

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

Keller graph

By examining the adjacency rules for a Keller graph, researchers can systematically test configurations relevant to Keller's conjecture in dimension n.

See correct answer

By examining the adjacency rules for a Keller graph, researchers can systematically test configurations relevant to Keller's conjecture in dimension n.

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

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

★★★★★★★★★★