On Perfect Matchings and Tilings in Uniform Hypergraphs

DOI10.1137/17M1128046zbMath1385.05063arXiv1705.00990OpenAlexW2963396236WikidataQ129971042 ScholiaQ129971042MaRDI QIDQ4638614

Jie Han

Publication date: 27 April 2018

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

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

zbMATH Keywords

hypergraphinduced subgraphperfect matchingabsorbing method

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ The bandwidth theorem for locally dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Polynomial-time perfect matchings in dense hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Perfect matchings in uniform hypergraphs with large minimum degree
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in 4-uniform hypergraphs
• A note on 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
• On Ramsey - Turan type theorems for hypergraphs
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• Matchings in 3-uniform hypergraphs
• The complexity of perfect matchings and packings in dense hypergraphs
• \(F\)-factors in hypergraphs via absorption
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• Tiling 3-Uniform Hypergraphs With K43−2e
• Triangle factors of graphs without large independent sets and of weighted graphs
• Recent advances on Dirac-type problems for hypergraphs
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
• The Complexity of Perfect Packings in Dense Graphs
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Triangle-Tilings in Graphs Without Large Independent Sets
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
• On Sets of Acquaintances and Strangers at any Party
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Embedding large subgraphs into dense graphs
• Graphs with 1-Factors
• Reducibility among Combinatorial Problems
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
• Minimum Vertex Degree Threshold for ‐tiling*
• Paths, Trees, and Flowers
• Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs
• Exact Minimum Codegree Threshold for K⁻₄-Factors
• Matchings in hypergraphs of large minimum degree
• A geometric theory for hypergraph matching
• On the maximal number of independent circuits in a graph

This page was built for publication: On Perfect Matchings and Tilings in Uniform Hypergraphs