Abstract
Given a positive integer and an -uniform hypergraph (or -graph for short) , the Turan number of is the maximum number of edges in an -graph on vertices that does not contain as a subgraph. The extension of is obtained as follows: For each pair of vertices in not contained in an edge of , we add a set of new vertices and the edge , where the 's are pairwise disjoint over all such pairs . Let denote the complete -graph on vertices. For all sufficiently large , we determine the Turan numbers of the extensions of a -uniform -matching, a -uniform linear star of size , and a -uniform linear star of size , respectively. We also show that the unique extremal hypergraphs are balanced blowups of , and , respectively. Our results generalize the recent result of Hefetz and Keevash [7].
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.