Product structure of graph classes with strongly sublinear separators

08/22/2022
by   David R. Wood, et al.
0

We investigate the product structure of hereditary graph classes admitting strongly sublinear separators. We characterise such classes as subgraphs of the strong product of a star and a complete graph of strongly sublinear size. In a more precise result, we show that if any hereditary graph class 𝒢 admits O(n^1-ϵ) separators, then for any fixed δ∈(0,ϵ) every n-vertex graph in 𝒢 is a subgraph of the strong product of a graph H with bounded tree-depth and a complete graph of size O(n^1-ϵ+δ). This result holds with δ=0 if we allow H to have tree-depth O(loglog n). We prove a product strengthening of the result of Dvořák and Norin [SIAM J. Discrete Math., 2016] for graphs of polynomial expansion. Finally, we prove that n-vertex graphs of bounded treewidth are subgraphs of the product of a graph with tree-depth d and a complete graph of size O(n^1/d), which is best possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2022

Product structure of graph classes with bounded treewidth

We show that many graphs with bounded treewidth can be described as subg...
research
10/09/2017

On classes of graphs with strongly sublinear separators

For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
research
01/24/2020

Notes on Graph Product Structure Theory

It was recently proved that every planar graph is a subgraph of the stro...
research
04/10/2022

On dually-CPT and strong-CPT posets

A poset is a containment of paths in a tree (CPT) if it admits a represe...
research
11/01/2019

Obstructions for bounded shrub-depth and rank-depth

Shrub-depth and rank-depth are dense analogues of the tree-depth of a gr...
research
01/19/2019

On the distance and algorithms of strong product digraphs

Strong product is an efficient way to construct a larger digraph through...
research
09/14/2021

Construction of k-matchings and k-regular subgraphs in graph products

A k-matching M of a graph G=(V,E) is a subset M⊆ E such that each connec...

Please sign up or login with your details

Forgot password? Click here to reset