Turán's theorem
From Wiktionary, the free dictionary
Archived revision by
Equinox
(
talk
|
contribs
)
as of 15:33, 8 May 2018.
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Contents
1
English
1.1
Etymology
1.2
Proper noun
1.2.1
Related terms
English
English
Wikipedia
has an article on:
Turán's theorem
Wikipedia
Etymology
Named after the Hungarian mathematician
Pál Turán
.
Proper noun
Turán
's
theorem
(
graph theory
)
A theorem stating that, among the
n
-
vertex
simple graphs with no (
r
+ 1)-
cliques
,
T
(
n
,
r
) has the
maximum
number of
edges
.
Related terms
Turán graph
Categories
:
English lemmas
English proper nouns
English uncountable nouns
English multiword terms
English terms spelled with Á
English terms spelled with ◌́
en:Graph theory
English eponyms
Hidden categories:
English terms with non-redundant non-automated sortkeys
English entries with language name categories using raw markup
Pages with entries
Pages with 1 entry
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Entry
Discussion
English
Views
Read
Edit
History
More
Search
Navigation
Main Page
Community portal
Requested entries
Recent changes
Random entry
Help
Glossary
Donations
Contact us
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Create a book
Printable version
In other projects
In other languages