Some Bounds for the Fragmentation Coefficient of Random Graphs
Sign Up to like & getrecommendations! Published in 2025 at "Axioms"
DOI: 10.3390/axioms14030208
Abstract: Graph fragmentation aims to find the smallest vertex subset whose removal breaks a graph into components of bounded size. While this problem has applications in network dismantling and combinatorics, theoretical bounds on optimal solutions remain… read more here.
Keywords: bounds fragmentation; random; asymptotically almost; almost surely ... See more keywords