Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Georg Anegg, Haris Angelidakis, Rico Zenklusen

Journal title: Symposium on Simplicity in Algorithms (SOSA)

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2021

Published pages: 196-203

DOI identifier: 10.1137/1.9781611976496.22

ISBN: 978-1-61197-649-6