The Grid Theorem for vertex-minors
نویسندگان
چکیده
We prove that, for each circle graph H, every with sufficiently large rank-width contains a vertex-minor isomorphic to H.
منابع مشابه
Rank-width and vertex-minors
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...
متن کاملTree-depth and Vertex-minors
In a recent paper [6], Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already before). We study the analogous questions for “depth” parameters of graphs, namely for the tree-depth and related new shrub-depth. We show that shrub-depth is monotone under taking vertex-minors, and that every graph c...
متن کاملRooted grid minors
Intuitively, a tangle of large order in a graph is a highly-connected part of the graph, and it is known that if a graph has a tangle of large order then it has a large grid minor. Here we show that for any k, if G has a tangle of large order and Z is a set of vertices of cardinality k that cannot be separated from the tangle by any separation of order less than k, then G has a large grid minor...
متن کاملAn accessibility theorem for infinite graph minors
In his recent collection [ 2 ] of open problems about infinite graphs, Halin defines the following hierarchy of graphs. He defines Γ0 to be the class of all graphs (finite or infinite), and for each ordinal μ > 0 he defines Γμ as the class of all graphs containing, for each λ < μ, infinitely many disjoint connected graphs from Γλ. Thus, Γ1 is the class of infinite graphs, Γ2 is the class of all...
متن کاملGrid Minors in Damaged Grids
We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds are tight to within constant factors. We also provide less-tight bounds on analogous problems for higher-dimensional grids.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.08.004