Linear trees in uniform hypergraphs

Details Linear trees in uniform hypergraphs Linear trees in uniform hypergraphs

2012-04-09

arxiv.org/abs/1204.1936v1

Mathematics

Combinatorics

13 pages, presented on Eurocomb 2011 (August 2011)

Scientific paper

Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of the largest T^k-free n-vertex hypergraph, i.e., the Turan number of T^k.

Affiliated with

Also associated with

No associations

Rating

Linear trees in uniform hypergraphs 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 Linear trees in uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear trees in uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652323