Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs

DOI10.1016/j.disc.2013.03.003zbMath1279.05049OpenAlexW2119569447MaRDI QIDQ389497

Xiaofeng Gu, Hong-Jian Lai

Publication date: 20 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.03.003

zbMATH Keywords

uniform hypergraphsdegree sequences\(k\)-edge-connectedhypergraphic sequences

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40) Vertex degrees (05C07)

Related Items (5)

Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ Edge-connectivity in hypergraphs ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected

Cites Work

• A theorem on flows in networks
• On graphic and 3-hypergraphic sequences
• Some NP-complete problems for hypergraph degree sequences
• Personal reminiscences and remarks on the mathematical work of Tibor Gallai
• Combinatorial Properties of Matrices of Zeros and Ones
• Degree Sequences in Complexes and Hypergraphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs