[Paper Review] Unifying duality theorems for width parameters in graphs and matroids. II. General duality

Reinhard Diestel, Sang‐il Oum|arXiv (Cornell University)|Jun 15, 2014

Advanced Graph Theory Research7 references3 citations

TL;DR

This paper establishes a generalized duality theorem for tangle-like dense objects in graphs and matroids, such as blocks and profiles, by introducing more general tree-like structures called S-graphs and relaxing forbidden sets from stars to weak stars. The key contribution is a duality framework that captures blocks and profiles—previously outside the scope of earlier duality theorems—by allowing non-tree structures and broader obstruction sets, proving that such generalizations are necessary and optimal for these objects.

ABSTRACT

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Motivation & Objective

• To develop a duality framework for tangle-like dense objects such as blocks and profiles in graphs and matroids, which were not captured by prior duality theorems based on S-trees.
• To identify why earlier duality theorems based on S-trees over stars fail to capture blocks and profiles, by showing that more general obstructions are required.
• To introduce S-graphs—graphs with few cycles—as the appropriate tree-like structures to witness the non-existence of blocks and profiles.
• To prove that the new duality theorem is best-possible for blocks and profiles by constructing graphs that admit neither such dense objects nor S-tree decompositions.
• To demonstrate that k-profiles and k-blocks are not dual to S_k-trees over stars in their respective forbidden families, necessitating more general obstruction sets.

Proposed method

• The paper generalizes the duality framework by allowing forbidden sets in orientations to be arbitrary collections of separations, with a focus on weak stars as a minimal sufficient class.
• It introduces S-graphs as a generalization of S-trees, allowing for graphs with few cycles to serve as witnesses for the non-existence of dense objects.
• The main duality theorem is proven by extending the weak duality framework from Part I, now allowing for consistent orientations avoiding weak stars rather than just stars.
• The authors show that the set of k-profiles corresponds exactly to consistent orientations of the separation system S_k that avoid a specific family of weak stars derived from the profile axioms.
• A construction of a graph with four K5 subgraphs and crossing separations is used to demonstrate that no S-tree decomposition exists for k=6, even though no k-block or k-profile exists.
• The paper analyzes the structure of forbidden sets for k-profiles and proposes an alternative family F of 3-stars formed by 'uncrossing' violating triples, showing that k-profiles are equivalent to F-avoiding consistent orientations.

Experimental results

Research questions

• RQ1 Why do standard duality theorems based on S-trees over stars fail to capture k-blocks and k-profiles in graphs and matroids?
• RQ2 What kind of generalized tree-like structure is necessary to dually witness the non-existence of tangle-like dense objects such as blocks and profiles?
• RQ3 Can k-profiles be characterized as consistent orientations avoiding a family of weak stars, and if so, is this family sufficient for a strong duality theorem?
• RQ4 Is there a graph that contains neither a k-block nor a k-profile but also fails to admit an S-tree decomposition over any star family, proving the necessity of S-graphs?
• RQ5 Can the forbidden sets for k-profiles be redefined as uncrossed 3-stars to recover a duality with S-trees, and is the resulting structure S_k-F-separable?

Key findings

• The paper proves that k-blocks and k-profiles cannot be dual to S_k-trees over stars in their respective forbidden families, necessitating a more general framework.
• An S-graph is constructed for a graph with four K5 subgraphs and crossing separations that witnesses the non-existence of a 6-block or 6-profile, demonstrating that S-trees are insufficient.
• The graph in Example 7.5 has no S-graph over S_6^{-} and the family of weak stars corresponding to B_6 or P_6, showing that even S-graphs may fail when the structure is too constrained.
• k-profiles are shown to be equivalent to consistent orientations of S_k avoiding a specific family of weak stars derived from the profile axioms, providing a new characterization.
• The paper constructs an S_k-tree over a family F of 3-stars formed by uncrossing violating triples, suggesting that a strong duality theorem for k-profiles may be possible with this new family.
• The authors conclude that the new duality framework is best-possible for blocks and profiles, as there exist graphs that contain neither such dense objects nor admit any S-tree decomposition.