AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, where c is a suitable absolute constant, must contain a copy of the Fano configuration (the projective plane of order two). This is an asymptotically sharp estimate
We consider the following Turán problem. How many edges can there be in a (q + 1)-uniform hypergraph...
... proof of an old result of Bollobás, which states that the maximum size of a cancellative triple ...
In this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing t...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractIt is shown that every n vertex triple system with every pair of vertices lying in at least ...
Given a 3-graph H, let ex2(n,H) denote the maximum value of the minimum co-degree of a 3-graph on n ...
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...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
Let F 3,2 denote the 3-graph ade, bde, cde}. We show that the maximum size of an F 3,2 -free 3-gra...
Let 2 ≤ q ≤ min{p, t − 1} be fixed and n → ∞. Suppose that F is a p-uniform hypergraph on n vertices...
AbstractLet t≥26 and let ℱ be a k-uniform hypergraph on n vertices. Suppose that |F1∩F2∩F3|≥t holds ...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint pl...
AbstractWe consider the following Turán problem. How many edges can there be in a (q+1)-uniform hype...
We consider the following Turán problem. How many edges can there be in a (q + 1)-uniform hypergraph...
... proof of an old result of Bollobás, which states that the maximum size of a cancellative triple ...
In this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing t...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractIt is shown that every n vertex triple system with every pair of vertices lying in at least ...
Given a 3-graph H, let ex2(n,H) denote the maximum value of the minimum co-degree of a 3-graph on n ...
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...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
Let F 3,2 denote the 3-graph ade, bde, cde}. We show that the maximum size of an F 3,2 -free 3-gra...
Let 2 ≤ q ≤ min{p, t − 1} be fixed and n → ∞. Suppose that F is a p-uniform hypergraph on n vertices...
AbstractLet t≥26 and let ℱ be a k-uniform hypergraph on n vertices. Suppose that |F1∩F2∩F3|≥t holds ...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint pl...
AbstractWe consider the following Turán problem. How many edges can there be in a (q+1)-uniform hype...
We consider the following Turán problem. How many edges can there be in a (q + 1)-uniform hypergraph...
... proof of an old result of Bollobás, which states that the maximum size of a cancellative triple ...
In this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing t...
DOI
Add to ORKG