Exact and approximate results on the least size of a graph with a given degree set

DOI10.1016/j.dam.2023.02.012OpenAlexW4323688027MaRDI QIDQ2700608

Aditya Sahdev, Amitabha Tripathi, Jai Moondra

Publication date: 27 April 2023

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

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

zbMATH Keywords

degree sequencegraphic sequencedegree set

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx) Diophantine equations (11Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the least size of a graph with a given degree set
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• Lattice translates of a polytope and the Frobenius problem
• Further results on degree sets for graphs
• A note on a theorem of Erdős and Gallai
• Complexity of the Frobenius problem
• On degree sets in \(k\)-partite graphs
• On degree sets and the minimum orders in bipartite graphs
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degree sets for graphs

This page was built for publication: Exact and approximate results on the least size of a graph with a given degree set