Corpus ID: 207779939

Obstructions for bounded shrub-depth and rank-depth

@article{Kwon2019ObstructionsFB,
  title={Obstructions for bounded shrub-depth and rank-depth},
  author={O. Kwon and R. McCarty and Sang-il Oum and P. Wollan},
  journal={ArXiv},
  year={2019},
  volume={abs/1911.00230}
}
  • O. Kwon, R. McCarty, +1 author P. Wollan
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth, which was conjectured by Hliněný, Kwon, Obdržalek, and Ordyniak [Tree-depth and vertex-minors, European J.~Combin. 2016]. Namely, we prove that a graph has large rank-depth if and only if it has a vertex-minor isomorphic to a long path. This implies that for… CONTINUE READING
    6 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Tree pivot-minors and linear rank-width
    • PDF
    Branch-depth: Generalizing tree-depth of graphs
    • 9
    • PDF
    Some classical model theoretic aspects of bounded shrub-depth classes
    • PDF
    Scattered Classes of Graphs
    • 3
    • PDF

    References

    SHOWING 1-10 OF 24 REFERENCES
    Tree-depth and Vertex-minors
    • 5
    • PDF
    Shrub-depth: Capturing Height of Dense Graphs
    • 23
    • PDF
    Rank-width and vertex-minors
    • Sang-il Oum
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2005
    • 190
    • PDF
    Branch-depth: Generalizing tree-depth of graphs
    • 9
    • PDF
    Tree-depth, subgraph coloring and homomorphism bounds
    • 212
    • Highly Influential
    • PDF
    Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width
    • 9
    • PDF
    Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded
    • 9
    • PDF
    Approximating clique-width and branch-width
    • 449
    • PDF
    Computing Small Pivot-Minors
    • 5
    • PDF