Almost Perfect Matchings in $k$-Partite $k$-Graphs

DOI10.1137/16M1097948zbMath1380.05144arXiv1608.04838MaRDI QIDQ4605443

Yan Wang, Hongliang Lu, Xingxing Yu

Publication date: 22 February 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.04838

zbMATH Keywords

hypergraphalmost perfect matchingminimum codegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (1)

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Cites Work

• Unnamed Item
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Matchings in k‐partite k‐uniform hypergraphs
• Near Perfect Matchings ink-Uniform Hypergraphs
• Probability and Computing
• Matchings in hypergraphs of large minimum degree

This page was built for publication: Almost Perfect Matchings in $k$-Partite $k$-Graphs