A Stability Result on Matchings in 3-Uniform Hypergraphs

DOI10.1137/21M1422720zbMath1498.05221arXiv2103.15127OpenAlexW3147618515MaRDI QIDQ5043638

Dingjia Mao, Hongliang Lu, Mingyang Guo

Publication date: 6 October 2022

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

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

zbMATH Keywords

stabilitymatchingfractional matching3-hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• Near perfect coverings in graphs and hypergraphs
• Proof of the Erdős matching conjecture in a new range
• Near-perfect clique-factors in sparse pseudorandom graphs
• Matchings in 3-uniform hypergraphs
• On the rainbow matching conjecture for 3-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• On Erdős' extremal problem on matchings in hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Perfect Matchings in k-Complexes
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Nearly Perfect Matchings in Uniform Hypergraphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: A Stability Result on Matchings in 3-Uniform Hypergraphs