Some Ore-type Results for Matching and Perfect Matching in k-uniform Hypergraphs
- 31 Downloads
Let S1 and S2 be two (k − 1)-subsets in a k-uniform hypergraph H. We call S1 and S2 strongly or middle or weakly independent if H does not contain an edge e ∈ E(H) such that S1 ∩ e ≠ ∅ and S2 ∩ e ≠ ∅ or e ⊆ S1 ∪ S2 or e ⊇ S1 ∪ S2, respectively. In this paper, we obtain the following results concerning these three independence. (1) For any n ≥ 2k2 − k and k ≥ 3, there exists an n-vertex k-uniform hypergraph, which has degree sum of any two strongly independent (k − 1)-sets equal to 2n−4(k−1), contains no perfect matching; (2) Let d ≥ 1 be an integer and H be a k-uniform hypergraph of order n ≥ kd+(k−2)k. If the degree sum of any two middle independent (k−1)-subsets is larger than 2(d−1), then H contains a d-matching; (3) For all k ≥ 3 and sufficiently large n divisible by k, we completely determine the minimum degree sum of two weakly independent (k − 1)-subsets that ensures a perfect matching in a k-uniform hypergraph H of order n.
KeywordsOre-type condition matching perfect matching hypergraph
MR(2010) Subject Classification05C65 05C70
Unable to display preview. Download preview PDF.
We thank the referees for their time and comments.
- Kühn, D., Osthus, D.: Embedding large subgraphs into dense graphs. In: Surverys in combinatorics 2009, volume 365 of London Math. Soc. Lecture Note Ser., Cambridge Univ. Press, Cambridge, 2009, 137–167Google Scholar
- Zhang, Y., Lu, M.: Matching in 3-uniform hypergraphs, submittedGoogle Scholar
- Zhang, Y., Zhao, Y., Lu, M.: Vertex degree sums for perfect matchings in 3-uniform hypergraphs, submittedGoogle Scholar
- Zhao, Y.: Recent advances on dirac-type problems for hypergraphs. In Recent Trends in Combinatorics, volume 159 of the IMA Volumes in Mathematics and its Applications. Springer, New York, 2016Google Scholar