On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

Details On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

2007-12-17

arxiv.org/abs/0712.2618v1

SIAM Journal on Discrete Mathematics, Vol. 21, No. 3, 2007, pp. 805-821

Mathematics

Combinatorics

17 pages, 5 figures

Scientific paper

10.1137/060675915

The problem of determining extremal hypergraphs containing at most r isomorphic copies of some element of a given hypergraph family was first studied by Boros et al. in 2001. There are not many hypergraph families for which exact results are known concerning the size of the corresponding extremal hypergraphs, except for those equivalent to the classical Turan numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k in {3,4}. We give a complete solution when k=3 and an almost complete solution (with eleven exceptions) when k=4.

Affiliated with

Also associated with

No associations

Rating

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115683