Perfect matching in 3 uniform hypergraphs with large vertex degree
نویسنده
چکیده
A perfect matching in a 3-uniform hypergraph on n = 3k vertices is a subset of n3 disjoint edges. We prove that if H is a 3-uniform hypergraph on n = 3k vertices such that every vertex belongs to at least ( n−1 2 ) − ( 2n/3 2 ) + 1 edges then H contains a perfect matching. We give a construction to show that this result is best possible.
منابع مشابه
Vertex Degree Sums for Perfect Matchings in 3-uniform Hypergraphs
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that H is a 3-uniform hypergraph whose order n is sufficiently large and divisible by 3. If H contains no isolated vertex and deg(u)+deg(v) > 2 3 n2− 8 3 n+2 for any two vertices u and v that are contained in some edge of H, then H contains a...
متن کاملMatchings and Tilings in Hypergraphs
We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2) matchings, we determine the partite minimum codegree threshold for matchings with at most one vertex left in each part, thereby answering a problem asked by Rödl and Ruciński. We further improve the partite minimum codegree conditions to sum of all k par...
متن کاملOn Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
We study sufficient l-degree (1 ≤ l < k) conditions for the appearance of perfect and nearly perfect matchings in k-uniform hypergraphs. In particular, we obtain a minimum vertex degree condition (l = 1) for 3-uniform hypergraphs, which is approximately tight, by showing that every 3-uniform hypergraph on n vertices with minimum vertex degree at least (5/9+o(1)) ` n 2 ́ contains a perfect matchi...
متن کاملPerfect matchings in 3-partite 3-uniform hypergraphs
Let H be a 3-partite 3-uniform hypergraph with each partition class of size n, that is, a 3-uniform hypergraph such that every edge intersects every partition class in exactly one vertex. We determine the Dirac-type vertex degree thresholds for perfect matchings in 3-partite 3-uniform hypergraphs.
متن کاملMatchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for hypergraphs. We also prove several related results which guarantee the existence of almost perfect matchings in r-uniform hypergraphs of large minimum degree. Our bounds on the minimum degree are essentially best poss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 27 شماره
صفحات -
تاریخ انتشار 2013