The polytope of degree partitions

zbMath1100.05022arXivmath/0512402MaRDI QIDQ2500965

Yanyan Li

Publication date: 30 August 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

degree sequence

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex degrees (05C07)

Related Items (7)

Geometry of paired comparisons ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ On dynamic threshold graphs and related classes ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ The polytope of dual degree partitions ⋮ Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs ⋮ The Burge correspondence and crystal graphs

This page was built for publication: The polytope of degree partitions