Stability on Matchings in 3-Uniform Hypergraphs
Sign Up to like & getrecommendations! Published in 2022 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-022-02483-1
Abstract: Given a positive integer r , let $$[r]=\{1,\ldots ,r\}$$ [ r ] = { 1 , … , r } . Let n , m be positive integers such that n is sufficiently large and… read more here.
Keywords: uniform hypergraphs; stability matchings; matchings uniform;