New graph parameters, flip-width, generalize key graph theory concepts for dense graphs.
Abstract
The paper introduces flip-width parameters for dense graphs, unifying Sparsity Theory and Twin-width Theory. It characterizes degeneracy, treewidth, and generalized coloring numbers. The study shows that classes with bounded flip-width include classes of bounded twin-width. The paper also discusses closure properties under transductions and provides an algorithm for approximating flip-width. Additionally, it introduces almost bounded flip-width as a dense counterpart to nowhere dense classes.
Flip-width
Stats
"A class has bounded expansion if each generalized coloring number is bounded by a constant."
"Every class of bounded twin-width has bounded flip-width."
Quotes
"The recent and already very successful Twin-width theory...provides a robust tameness condition for graph classes."
"We propose a new family of graph parameters, called flip-width...offering a compelling dense counterpart of classes of bounded expansion."