A new approach to Turán's conjecture (Q1066899): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q122886665, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hyperconnectivity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A class of constructions for Turan's (3,4)-problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5512796 / rank | |||
Normal rank | |||
Revision as of 19:36, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approach to Turán's conjecture |
scientific article |
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
