Movatterモバイル変換
[0]
ホーム
URL:
画像なし
夜間モード
Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main Page
Community portal
Requested entries
Recent changes
Random entry
Help
Glossary
Contact us
Special pages
Search
Search
Appearance
Donations
Create account
Log in
Personal tools
Donations
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Contents
move to sidebar
hide
Beginning
1
English
Toggle English subsection
1.1
Etymology
1.2
Noun
Toggle the table of contents
Kneser graph
Not in other languages
Entry
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Create a book
Download as PDF
Printable version
In other projects
Appearance
move to sidebar
hide
From Wiktionary, the free dictionary
English
[
edit
]
English
Wikipedia
has an article on:
Kneser graph
Wikipedia
Etymology
[
edit
]
Named after Martin Kneser, who first investigated them in 1956.
Noun
[
edit
]
Kneser
graph
(
plural
Kneser graphs
)
(
graph theory
)
A
graph
K
(
n
,
k
)
(alternatively
KG
n
,
k
), whose
vertices
correspond to the
k
-
element
subsets
of a
set
of
n
elements, and where two vertices are
adjacent
iff
the two corresponding sets are
disjoint
.
Retrieved from "
https://en.wiktionary.org/w/index.php?title=Kneser_graph&oldid=84012204
"
Categories
:
English lemmas
English nouns
English countable nouns
English multiword terms
en:Graph theory
English eponyms
Hidden categories:
Pages with entries
Pages with 1 entry
Search
Search
Toggle the table of contents
Kneser graph
Not in other languages
Add topic
[8]
ページ先頭
©2009-2025
Movatter.jp
