A new approach to Turán's conjecture (Q1066899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3926921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to Turán's conjecture |
scientific article; zbMATH DE number 3926921 |
Statements
A new approach to Turán's conjecture (English)
0 references
1985
0 references
Let t(n,r,k) denote the minimum size of a family \({\mathcal G}\) of k-element subsets of an n-element set X such that any r-subset of X contains a member of \({\mathcal G}\), i.e. a k-uniform hypergraph without an independent set of size r. Such a hypergraph will be called an (r,k)-graph. Turán's conjecture is concerned with (4,3)-graphs. In this note some related conjectures are stated.
0 references
subsets
0 references
hypergraph
0 references
Turán's conjecture
0 references
0.8205975890159607
0 references
0.8192034363746643
0 references
