Covering symmetric supermodular functions by uniform hypergraphs

DOI10.1016/j.jctb.2003.12.004zbMath1048.05064OpenAlexW2094692022MaRDI QIDQ598465

Tamás Király

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.12.004

zbMATH Keywords

Connectivity augmentationHypergraphsSupermodularity

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (4)

The Generalized Terminal Backup Problem ⋮ A Survey on Covering Supermodular Functions ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete

Cites Work

• Edge-connectivity augmentation problems
• Edge-augmentation of hypergraphs
• Augmenting hypergraphs by edges of size two
• Covering symmetric supermodular functions by graphs
• Coverings and structure of crossing families
• Hypergraph connectivity augmentation

This page was built for publication: Covering symmetric supermodular functions by uniform hypergraphs