No label defined (Q3218170)

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 3884215
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3884215

      Statements

      0 references
      0 references
      1983
      0 references
      n-uniform clique
      0 references
      hypergraph
      0 references
      By an n-uniform clique, we mean a hypergraph with each edge containing exactly n vertices and each pair of edges having a non-empty intersection. this paper is concerned with n-uniform cliques which satisfy at least one of the following conditions. (1) It is 3-chromatic. (2) No set of n or less vertices (other than the edges themselves) has a non-empty intersection with each edge. (3) No set of less than n vertices has a non-empty intersection with each edge. (4) For each vertex x and each edge E, there exists another edge F so that \(E\cap F=\{x\}.\) (5) For each vertex x, there exist edges E and F such that \(E\cap F=\{x\}.\) It follows from a result of \textit{P. Erdős} and \textit{L. Lovász} [Colloq. Math. Soc. Janos Bolyai 10, 609-627 (1975; Zbl 0315.05117)] that, for a given n and i, the number of n-uniform cliques which satisfy condition (i) is finite. The authors prove: ''Theorem. For \(i=1,2,3,4,5\), the set of possible number of vertices in n uniform cliques satisfying condition (i) contains the interval \([2n-1,\left( \begin{matrix} 2n-2\\ n- 1\end{matrix} \right)+2n-2].\) For \(i=1,2,3\) and \(n=2,3,4\), the set of possible numbers of equal to the interval.''
      0 references

      Identifiers