The polytope of degree sequences of hypergraphs

DOI10.1016/S0024-3795(02)00272-0zbMath1002.05016MaRDI QIDQ1611881

N. L. Bhanu Murthy, Murali K. Srinivasan

Publication date: 28 August 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

polytopehypergraphsthreshold graphsdegree sequencescharacerizationthreshold sequences

Mathematics Subject Classification ID

Integer programming (90C10) Hypergraphs (05C65) Combinatorial optimization (90C27) Vertex degrees (05C07)

Related Items (7)

Optimization over Degree Sequences ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ Essential points of the \(n\)-cube subset partitioning characterisation ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Numerical characterization of \(n\)-cube subset partitioning ⋮ Relations on generalized degree sequences ⋮ Numerical characterisation of n-cube subset partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The polytope of degree sequences
• On graphic and 3-hypergraphic sequences
• Some NP-complete problems for hypergraph degree sequences
• Linear optimization and extensions.
• Geometric algorithms and combinatorial optimization.
• Degree sequences and majorization
• Threshold graphs and related topics
• Extreme degree sequences of simple graphs
• Degree Sequences in Complexes and Hypergraphs

This page was built for publication: The polytope of degree sequences of hypergraphs