Connectivity in Hypergraphs

DOI10.4153/CMB-2018-005-9zbMath1390.05150arXiv1611.07087OpenAlexW3099865855MaRDI QIDQ4569602

David A. Pike, Megan Dewar, John Proos

Publication date: 26 June 2018

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitytransversal

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Related Items (16)

Cut vertex transit functions of hypergraphs ⋮ Whitney's connectivity inequalities for directed hypergraphs ⋮ Unnamed Item ⋮ On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Maximally connected \(p\)-partite uniform hypergraphs ⋮ The edge‐connectivity of vertex‐transitive hypergraphs ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ Relating hypergraph parameters of generalized power graphs ⋮ Edge-connectivity in hypergraphs ⋮ ON c-SPACES AND HYPERGRAPHS ⋮ Connectivity of Cartesian product of hypergraphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ Finding the shortest path for a Hypergraph ⋮ On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs

This page was built for publication: Connectivity in Hypergraphs