Growing balanced covering sets

DOI10.1016/j.disc.2021.112554zbMath1478.05117arXiv2102.10862OpenAlexW3188160532MaRDI QIDQ1981677

Tung H. Nguyen

Publication date: 6 September 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.10862

zbMATH Keywords

bipartite graphscovering setsweighted hypergraphsSteinitz lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Cites Work

• Generalized Kneser coloring theorems with combinatorial proofs
• Combinatorial necklace splitting
• On the Power of Linear Dependencies
• Six Standard Deviations Suffice
• Pure Pairs VI: Excluding an Ordered Tree

This page was built for publication: Growing balanced covering sets