Turán number
Summary
In mathematics, the Turán number for -uniform hypergraphs of order is the smallest number of -edges such that every induced subgraph on vertices contains an edge. This number was determined for by (Turán 1941), and the problem for general was introduced in (Turán 1961). The paper (Sidorenko 1995) gives a survey of Turán numbers.
Further reading
- Wikipedia, page 14982946, revision 1354036835, Turán number. adopted
About this page
| Tag | M09T8TFVWF |
|---|---|
| URI | m2://M09T8TFVWF |
| Aliases | turan-system |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.