Near Perfect Matchings ink-Uniform Hypergraphs

DOI10.1017/S0963548314000613zbMath1371.05228arXiv1404.1136OpenAlexW2967508960MaRDI QIDQ5364253

Jie Han

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (14)

Matching of Given Sizes in Hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Unnamed Item ⋮ On vertex independence number of uniform hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Almost Perfect Matchings in $k$-Partite $k$-Graphs ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Matching in 3-uniform hypergraphs ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ Nearly Perfect Matchings in Uniform Hypergraphs

Cites Work

• Unnamed Item
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Tight co-degree condition for perfect matchings in 4-graphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in 4-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
• Matchings in 3-uniform hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Matchings in hypergraphs of large minimum degree

This page was built for publication: Near Perfect Matchings ink-Uniform Hypergraphs