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 BDR\(^P\), 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 again two variants. For BDR\(^P\), where the partition is given as part of the input, a complete characterization was known for determining whether the bi-sequence is r-max-bigraphic, namely, if 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. As for the variant BDR, where the partition is not given, we show that determining whether a given (single) sequence admits a bipartite multigraph realization is NP-hard. 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.
This work was supported by US-Israel BSF grant 2018043.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
All sequence that we consider are assumed to be of positive integers and in a non-increasing order.
- 2.
If \(d_1 = 1\), we define \(\text {box}(d) = 0\). Note that in this case d is realized by a matching graph.
References
Bar-Noy, A., Böhnlein, T., Peleg, D., Perry, M., Rawitz, D.: Relaxed and approximate graph realizations. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 3–19. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79987-8_1
Bar-Noy, A., Böhnlein, T., Peleg, D., Rawitz, D.: On realizing a single degree sequence by a bipartite graph. In: 18th SWAT, vol. 227 of LIPIcs, pp. 1:1–1:17 (2022)
Bar-Noy, A., Böhnlein, T., Peleg, D., Rawitz, D.: On the role of the high-low partition in realizing a degree sequence by a bipartite graph. In: 47th MFCS, vol. 241 of LIPIcs, pp. 14:1–14:15 (2022)
Burstein, D., Rubin, J.: Sufficient conditions for graphicality of bidegree sequences. SIAM J. Discret. Math. 31(1), 50–62 (2017)
Chungphaisan, V.: Conditions for sequences to be r-graphic. Discr. Math. 7(1–2), 31–39 (1974)
Erdös, P., Gallai, T.: Graphs with prescribed degrees of vertices [Hungarian]. Mat. Lapok (N.S.) 11, 264–274 (1960)
Gale, D.: A theorem on flows in networks. Pacific J. Math 7(2), 1073–1082 (1957)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)
Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph -I. SIAM J. Appl. Math. 10(3), 496–506 (1962)
Havel, V.: A remark on the existence of finite graphs [in Czech]. Casopis Pest. Mat. 80, 477–480 (1955)
Hulett, H., Will, T.G., Woeginger, G.J.: Multigraph realizations of degree sequences: maximization is easy, minimization is hard. Oper. Res. Lett. 36(5), 594–596 (2008)
Miller, J.W.: Reduced criteria for degree sequences. Discr. Math. 313(4), 550–562 (2013)
Owens, A.B., Trent, H.M.: On determining minimal singularities for the realizations of an incidence sequence. SIAM J. Appl. Math. 15(2), 406–418 (1967)
Rao, S.B.: A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences. In: Rao, S.B. (ed.) Combinatorics and Graph Theory. LNM, vol. 885, pp. 417–440. Springer, Heidelberg (1981). https://doi.org/10.1007/BFb0092288
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371–377 (1957)
Tripathi, A., Vijay, S.: A note on a theorem of Erdös & Gallai. Discr. Math. 265(1–3), 417–420 (2003)
Will, T.G., Hulett, H.: Parsimonious multigraphs. SIAM J. Discr. Math. 18(2), 241–245 (2004)
Zverovich, I.E., Zverovich, V.E.: Contributions to the theory of graphic sequences. Discr. Math. 105(1–3), 293–303 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bar-Noy, A., Böhnlein, T., Peleg, D., Rawitz, D. (2023). Degree Realization by Bipartite Multigraphs. In: Rajsbaum, S., Balliu, A., Daymude, J.J., Olivetti, D. (eds) Structural Information and Communication Complexity. SIROCCO 2023. Lecture Notes in Computer Science, vol 13892. Springer, Cham. https://doi.org/10.1007/978-3-031-32733-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-32733-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-32732-2
Online ISBN: 978-3-031-32733-9
eBook Packages: Computer ScienceComputer Science (R0)