Grid minors in damaged grids (Q405308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6340244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grid minors in damaged grids |
scientific article; zbMATH DE number 6340244 |
Statements
Grid minors in damaged grids (English)
0 references
4 September 2014
0 references
Summary: 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.
0 references
grid graphs
0 references
graph minors
0 references
subgraphs
0 references
shallow minors
0 references
treewidth
0 references
vertex deletion
0 references
0 references
0.750536322593689
0 references
0.7503947615623474
0 references
0.7446226477622986
0 references
0.7439671158790588
0 references
0.743789792060852
0 references
