Stability on matchings in 3-uniform hypergraphs

DOI10.1007/s00373-022-02483-1zbMath1486.05215OpenAlexW4226084451MaRDI QIDQ2124791

Mingyang Guo, Hongliang Lu

Publication date: 11 April 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02483-1

zbMATH Keywords

stabilityhypergraphsmatchings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A degree version of the Hilton-Milner theorem
• Matchings in 3-uniform hypergraphs
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• The structure of large intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• A hierarchy of maximal intersecting triple systems
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Stability on matchings in 3-uniform hypergraphs