Larger matchings and independent sets in regular uniform hypergraphs of high girth
Combinatorics
2023-07-31 v1
Abstract
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on -uniform -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.
Cite
@article{arxiv.2307.15601,
title = {Larger matchings and independent sets in regular uniform hypergraphs of high girth},
author = {Deepak Bal and Patrick Bennett},
journal= {arXiv preprint arXiv:2307.15601},
year = {2023}
}