Yair Caro

Nordhaus–Gaddum‐Type Theorems for Maximum Average Degree

ABSTRACT A ‐decomposition of a graph is a partition of its edge set into spanning subgraphs . The classical theorem of Nordhaus and Gaddum bounds and over all 2‐decompositions of . For a graph parameter , let , taken over all ‐decompositions of graph . In this paper, we consider...