Degree Realization by Bipartite Multigraphs.

Saved in:

Bibliographic Details
Title:	Degree Realization by Bipartite Multigraphs.
Authors:	Bar-Noy, Amotz¹, Böhnlein, Toni², Peleg, David³, Rawitz, Dror⁴
Source:	Discrete Mathematics & Theoretical Computer Science (DMTCS). 2026, Vol. 28 Issue 2, p1-21. 21p.
Subjects:	Bipartite graphs, Multigraph, Graph theory, NP-hard problems, Algorithms
Abstract:	The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing multigraph is required to be bipartite. The problem of characterizing degree sequences that can be realized by a bipartite (simple) graph has two variants. In the simpler one, termed BDRP, the partition of the degree sequence into two sides is given as part of the input. A complete characterization for realizability in this variant was given by Gale and Ryser over sixty years ago. However, the variant where the partition is not given, termed BDR, is still open. For bipartite multigraph realizations, there are also two variants. For BDRP, where the partition is given as part of the input, a complete characterization was known for determining whether there is a multigraph realization whose underlying graph is bipartite, such that the maximum number of copies of an edge is at most r. We present a complete characterization for determining if there is a bipartite multigraph realization such that the total number of excess edges is at most t. We show that optimizing these two measures may lead to different realizations, and that optimizing by one measure may increase the other substantially. As for the variant BDRP, where the partition is not given, we show that determining whether a given (single) sequence admits a bipartite multigraph realization is NP-hard. Moreover, we show that this hardness result extends to any graph family which is a sub-family of bipartite graphs and a super-family of paths. On the positive side, we provide an algorithm that computes optimal realizations for the case where the number of balanced partitions is polynomial, and present sufficient conditions for the existence of bipartite multigraph realizations that depend only on the largest degree of the sequence. [ABSTRACT FROM AUTHOR]
	Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing multigraph is required to be bipartite. The problem of characterizing degree sequences that can be realized by a bipartite (simple) graph has two variants. In the simpler one, termed BDRP, the partition of the degree sequence into two sides is given as part of the input. A complete characterization for realizability in this variant was given by Gale and Ryser over sixty years ago. However, the variant where the partition is not given, termed BDR, is still open. For bipartite multigraph realizations, there are also two variants. For BDRP, where the partition is given as part of the input, a complete characterization was known for determining whether there is a multigraph realization whose underlying graph is bipartite, such that the maximum number of copies of an edge is at most r. We present a complete characterization for determining if there is a bipartite multigraph realization such that the total number of excess edges is at most t. We show that optimizing these two measures may lead to different realizations, and that optimizing by one measure may increase the other substantially. As for the variant BDRP, where the partition is not given, we show that determining whether a given (single) sequence admits a bipartite multigraph realization is NP-hard. Moreover, we show that this hardness result extends to any graph family which is a sub-family of bipartite graphs and a super-family of paths. On the positive side, we provide an algorithm that computes optimal realizations for the case where the number of balanced partitions is polynomial, and present sufficient conditions for the existence of bipartite multigraph realizations that depend only on the largest degree of the sequence. [ABSTRACT FROM AUTHOR]
ISSN:	13658050