[Paper Review] Multigraphs without large bonds are well-quasi-ordered by contraction

Marcin Kamiński, Jean‐Florent Raymond+1 more|arXiv (Cornell University)|Dec 7, 2014

Advanced Topology and Set Theory3 citations

TL;DR

This paper proves that multigraphs with at most $p$ connected components and all bonds of size at most $k$ are well-quasi-ordered under edge contraction for any positive integers $p$ and $k$. It further characterizes the canonical antichains for this ordering and shows they are fundamental, establishing a structural classification for this class of multigraphs.

ABSTRACT

We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also characterize canonical antichains for this relation and show that they are fundamental.

Motivation & Objective

• To establish that multigraphs with at most $p$ connected components and bonds of size at most $k$ are well-quasi-ordered by edge contraction.
• To characterize the canonical antichains in this well-quasi-ordering relation.
• To show that these canonical antichains are fundamental, meaning they represent the minimal obstruction sets for the ordering.

Proposed method

• Use of structural graph theory to analyze edge contraction in multigraphs with bounded component count and bond size.
• Application of the theory of well-quasi-orders to edge contraction relations on multigraphs.
• Identification of minimal obstruction sets (canonical antichains) through combinatorial analysis of edge cuts and connectivity.
• Proof that these antichains are fundamental by showing they cannot be reduced without violating the antichain property.
• Use of inductive arguments on the number of components and bond size to generalize results across all $p$ and $k$.
• Leveraging the minimality of bonds (as minimal non-empty edge cuts) to constrain the structure of allowed multigraphs.

Experimental results

Research questions

• RQ1 Are multigraphs with at most $p$ connected components and all bonds of size at most $k$ well-quasi-ordered under edge contraction for any positive integers $p$ and $k$?
• RQ2 What are the canonical antichains in the well-quasi-ordering of such multigraphs?
• RQ3 Are these canonical antichains fundamental, meaning they form minimal obstruction sets for the ordering relation?
• RQ4 How does the structure of bonds (minimal non-empty edge cuts) constrain the well-quasi-ordering behavior under contraction?
• RQ5 Can the class of such multigraphs be fully characterized via their antichain structure?

Key findings

• The class of multigraphs with at most $p$ connected components and all bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p$ and $k$.
• Canonical antichains for this ordering are completely characterized and correspond to specific families of multigraphs with extremal structural properties.
• These canonical antichains are fundamental, meaning they are minimal with respect to inclusion and cannot be reduced while preserving the antichain property.
• The proof relies on the boundedness of both component count and bond size to control the complexity of edge contraction sequences.
• The result establishes a finite obstruction set for the well-quasi-ordering, implying that any infinite sequence of such multigraphs contains a pair where one contracts to the other.
• The characterization of antichains provides a complete structural understanding of the minimal obstructions to well-quasi-ordering in this context.