Larger matchings and independent sets in regular uniform hypergraphs of high girth Article Swipe
Related Concepts
Combinatorics
Girth (graph theory)
Matching (statistics)
Mathematics
Set (abstract data type)
Hypergraph
Independent set
Discrete mathematics
Computer science
Statistics
Graph
Programming language
Deepak Bal
,
Patrick Bennett
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2307.15601
· OA: W4385437755
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2307.15601
· OA: W4385437755
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth. As a result we obtain new lower bounds on the size of a maximum matching or independent set in such hypergraphs.
Related Topics
Finding more related topics…