Packing spanning partition-connected subgraphs with small degrees
Morteza Hasanvand

TL;DR
This paper develops new methods for packing spanning subgraphs with controlled degrees in partition-connected graphs, generalizing existing results and providing decomposition techniques for such graphs.
Contribution
It introduces conditions for the existence of degree-bounded, partition-connected spanning subgraphs and their decomposition into edge-disjoint parts, extending previous theories.
Findings
Established degree bounds for spanning subgraphs in partition-connected graphs.
Provided a decomposition method for partition-connected graphs into multiple subgraphs.
Generalized several known results in graph connectivity and packing theory.
Abstract
Let be a graph with and let be an intersecting supermodular subadditive integer-valued function on subsets of . The graph is said to be -partition-connected, if for every partition of , , where denotes the number of edges of joining different parts of . Let be a real number and let be a real function on . In this paper, we show that if is -partition-connected and for all , then has an -partition-connected spanning subgraph such that for each vertex , , where denotes the number of edges of with both ends in and denotes the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Advanced Graph Theory Research · graph theory and CDMA systems
