학술논문
Détermination de valeurs du nombre de Turán $T(n,\,4,\,6)$.
Document Type
Journal
Author
Droesbeke, F. AMS Author Profile; Loréa, M. AMS Author Profile
Source
Subject
05 Combinatorics -- 05C Graph theory
05C55Generalized Ramsey theory
05C65Hypergraphs
05C55
05C65
Language
English
Abstract
Let $T(n,4,6)$ be the minimal number of edges of a 4-uniform hypergraph of order $n$ such that any set of 6 vertices contains at least one edge. In this paper the authors obtain some values of this Turán number for all $n$ with $6\leq n\leq 10$.