Perfect Matching in k-partite k-graphs and 3-uniform HM-bipartite Hypergraphs

作     者：Chun-qiu FANG Mei LU Chun-qiu FANG;Mei LU

作者机构：Department of Mathematical SciencesTsinghua UniversityBeijing 100084China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2020年第36卷第3期

页      面：636-641页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported in part by the National Natural Science Foundation of China (No. 61373019) 

主　　题：Perfect matching k-partite k-graph hm-bipartite hypergraph 

摘      要：Let H=(V,E)be an n-balanced k-partite k-graph with partition classes V1,...,*** for every legal(k-1)-tuple f contained in V\V1 and for every legal(k-1)-tuple g contained in V\Vk such that f∪g■E(H),we have d(f)+d(g)≥n+*** this paper,we prove that under this condition H must have a perfect *** result of this paper is about the perfect matching in 3-uniform hm-bipartite *** G be a 3-uniform hm-bipartite hypergraph with one of whose sides V1 has the size n,the another side V2 has size 2 *** for all the legal 2-tuple f with|f∩V1|=1 and for all the legal 2-tuple g with|g∩V1|=0,we have d(f)≥n-2 and d(g)n/2,then G has a perfect matching.