Pages that link to "Item:Q389497"

The following pages link to Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497):

Displaying 5 items.

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