AbstractIt is shown that every n vertex triple system with every pair of vertices lying in at least (1/2+o(1))n triples contains a copy of the Fano plane. The constant 1/2 is sharp. This is the first triple system for which such a (nonzero) constant is determined
AbstractFor a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guar...
AbstractThere is a graph G with 300,000,000 vertices and no clique on four points, such that if its ...
AbstractLet the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plu...
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 ...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractFor a family of r-graphs F the Turán number ex (n, F) is the maximum number of edges in an n...
AbstractFor an r-graph H, let C(H)=minSd(S), where the minimum is taken over all (r−1)-sets of verti...
The minimum positive co-degree of a non-empty $r$-graph ${H}$, denoted $\delta_{r-1}^+( {H})$, is th...
This publication is with permission of the rights owner freely accessible due to an Alliance licence...
AbstractThe Erdős–Stone–Simonovits Theorem implies that the Turán density of a family of gra...
The hypergraph Ramsey number of two 3-uniform hypergraphs G and H, de- noted by R(G,H), is the least...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractThe codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
AbstractFor a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guar...
AbstractThere is a graph G with 300,000,000 vertices and no clique on four points, such that if its ...
AbstractLet the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plu...
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 ...
AbstractA conjecture of V. Sós [3] is proved that any set of 34 (n3)+cn2 triples from an n-set, wher...
AbstractFor a family of r-graphs F the Turán number ex (n, F) is the maximum number of edges in an n...
AbstractFor an r-graph H, let C(H)=minSd(S), where the minimum is taken over all (r−1)-sets of verti...
The minimum positive co-degree of a non-empty $r$-graph ${H}$, denoted $\delta_{r-1}^+( {H})$, is th...
This publication is with permission of the rights owner freely accessible due to an Alliance licence...
AbstractThe Erdős–Stone–Simonovits Theorem implies that the Turán density of a family of gra...
The hypergraph Ramsey number of two 3-uniform hypergraphs G and H, de- noted by R(G,H), is the least...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractThe codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
AbstractFor a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guar...
AbstractThere is a graph G with 300,000,000 vertices and no clique on four points, such that if its ...
AbstractLet the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plu...
DOI
Add to ORKG