Treewidth of Grid Subsets

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10401432" target="_blank" >RIV/00216208:11320/18:10401432 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=wrd_IgwR76" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=wrd_IgwR76</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00493-017-3538-5" target="_blank" >10.1007/s00493-017-3538-5</a>

Result language
angličtina
Original language name
Treewidth of Grid Subsets
Original language description
Let Q(n) be the 3-dimensional n x n x n grid with all non-decreasing diagonals (including the facial ones) in its constituent unit cubes. Suppose that a set S subset of V (Q(n)) separates the left side of the grid from the right side. We show that S induces a subgraph of tree-width at least n/root 18 - 1 We use a generalization of this claim to prove that the vertex set of Q(n) cannot be partitioned to two parts, each of them inducing a subgraph of bounded tree-width.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)