Name
Abstract | ||
|---|---|---|
Let f"r(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not contain four distinct edges A, B, C, D with A@?B=C@?D and A@?B=C@?D=@A. This problem was stated by Erdos [P. Erdos, Problems and results in combinatorial analysis, Congr. Numer. 19 (1977) 3-12]. It can be viewed as a generalization of the Turan problem for the 4-cycle to hypergraphs. Let @f"r=lim@?sup"n"-"~f"r(n)/(nr-1). Furedi [Z. Furedi, Hypergraphs in which all disjoint pairs have distinct unions, Combinatorica 4 (1984) 161-168] observed that @f"r=1 and conjectured that this is equality for every r=3. The best known upper bound @f"r==3, and @f"3=1 as r-~. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jcta.2008.09.002 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
generalized 4-cycles,generalized 4-cycle,r-uniform hypergraph,n vertex,combinatorial analysis,distinct edge,z. furedi,distinct union,turan problem,turán function,maximum number,p. erdos,maximum size,disjoint pair | Discrete mathematics,Combinatorics,Disjoint sets,Vertex (geometry),Upper and lower bounds,Hypergraph,Constraint graph,Combinatorial analysis,Mathematics | Journal |
Volume | Issue | ISSN |
116 | 3 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
5 | 0.62 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |
| Jacques Verstraëte | 2 | 192 | 26.99 |