A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs

DOI10.1137/20M1364825zbMath1486.05047arXiv2008.12222OpenAlexW3081273614MaRDI QIDQ5071104

Joseph Hyde, Candida Bowtell

Publication date: 20 April 2022

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

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

zbMATH Keywords

hypergraphsperfect matchingsvertex degreedegree sequences

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)

On sufficient conditions for spanning structures in dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• Matchings in 3-uniform hypergraphs
• On perfect packings in dense graphs
• A degree sequence version of the Kühn-Osthus tiling theorem
• On Hamilton's ideals
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• Recent advances on Dirac-type problems for hypergraphs
• On Degree Sequences Forcing The Square of a Hamilton Cycle
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Critical chromatic number and the complexity of perfect packings in graphs
• Embedding Spanning Bipartite Graphs of Small Bandwidth
• Reducibility among Combinatorial Problems
• A Degree Sequence Komlós Theorem
• A geometric theory for hypergraph matching
• The Factorization of Linear Graphs
• Some Theorems on Abstract Graphs
• A median-type condition for graph tiling

This page was built for publication: A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs