No label defined (Q3676175)
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 3896979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3896979 |
Statements
1983
0 references
hypergraph
0 references
k-clique
0 references
clique-free
0 references
Turán's problem
0 references
0.8024303317070007
0 references
0.7935697436332703
0 references
0.7927005290985107
0 references
0.789291262626648
0 references
Let \(H=(V,E)\) be a hypergraph, where E is a family of nonempty subsets of V. A subset A of V is called a clique of E, if every subset of A is contained in at least one element of E or contains at least one element of E. A clique A is sometimes called a k-clique, if \(| A| =k\). A subset \(\xi\) of \(\binom Vk\), the family of all the k-element subsets of V, is said to be \((k+1)\)-clique-free if \(\xi\) does not have any \((k+1)\)- clique. Let f(m,k) be the maximum cardinality of E which is \((k+1)\)- clique-free, where \(m=| V|\). The problem of determining f(m,k) generalizes the well-known Turán's problem. The following results are proved. Theorem 2.1. Let \(m\geq k\geq 3\) be integers and put \(m=kp+q\) \((0\leq q<k)\). Then \[ \begin{multlined} \frac{(k-1)(m-k)+k}{k^2}\binom m{k-1} \geq f(m,k) \geq \\ \geq \begin{cases} p^ k+ \binom p{k-1} pk\quad&\text{(when \(q=0\)),} \\ (p+1)^ q p^{k-q} + \binom p{k-1} p^2 k - pk^2 + pqk - k + 2pk + q + 1p - k + 2\quad&\text{(when \(q\geq1\))} \end{cases} \end{multlined} \] holds, where \(\binom nr = 0\) for those integers \(n\) and \(r\) satisfying \(0\leq n<r\). Theorem 4.1. Let \(m\geq3\) be an integer. Then \(f(m,3) \leq \left[\frac{(m-1)^3+1}{9}\right]\).
0 references