Abstract
In May 2022, Glock, Joos, Kim, Kühn, and Lichev[Conflict-free hypergraph matchings, Proceedings of the 2023Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2023) -2991-3005] developed a strategy to find near-perfect matchings in uniform hypergraphs while avoiding certain subsets. This work was very recently extended by Joos, Mubayi, and Smith [Conflict-free Hypergraph Matchings an…