最終更新日
：2023/09/06
Keller graph
noun
(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.
意味（1）
(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.
復習用の問題
正解を見る
(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.
The Keller graph is a connected graph with a unique perfect matching.
正解を見る
The Keller graph is a connected graph with a unique perfect matching.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
