AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph isomorphic to F. Let ex(n,F) denote the size of a largest F-free hypergraph G⊆[n]3. Let Fn(F) denote the number of distinct labelled F-free G⊆[n]3. We show that Fn(F)=2ex(n,F)+o(n3), and discuss related problems
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Abstract. For a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergra...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that ...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
The Erdos–Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not con...
AbstractLet Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [A. Razborov, On 3-hype...
Gyárfás, Gyori, and Simonovits [J. Comb., 7 (2016), pp. 205–216] proved that if a 3-uniform hypergra...
AbstractIf a system H of triples (3-uniform hypergraph) on n vertices has the following property: fo...
International audienceLet d and t be fixed positive integers, and let K d t,...,t denote the complet...
The Erdős–Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not con...
AbstractLet tr(n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n verti...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Abstract. For a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergra...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that ...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
The Erdos–Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not con...
AbstractLet Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [A. Razborov, On 3-hype...
Gyárfás, Gyori, and Simonovits [J. Comb., 7 (2016), pp. 205–216] proved that if a 3-uniform hypergra...
AbstractIf a system H of triples (3-uniform hypergraph) on n vertices has the following property: fo...
International audienceLet d and t be fixed positive integers, and let K d t,...,t denote the complet...
The Erdős–Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not con...
AbstractLet tr(n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n verti...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
DOI
Add to ORKG