TWIN-WIDTH AND PERMUTATIONS

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493121" target="_blank" >RIV/00216208:11320/24:10493121 - isvavai.cz</a>
Výsledek na webu
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=p52etS2.O_" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=p52etS2.O_</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.46298/LMCS-20(3:4)2024" target="_blank" >10.46298/LMCS-20(3:4)2024</a>

Jazyk výsledku
angličtina
Název v původním jazyce
TWIN-WIDTH AND PERMUTATIONS
Popis výsledku v původním jazyce
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomasse, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been further extended to binary structures, in several (basically equivalent) ways. We prove that a class of binary relational structures (that is: edge-colored partially directed graphs) has bounded twin-width if and only if it is a first-order transduction of a proper permutation class. As a by-product, we show that every class with bounded twin-width contains at most 2^(O(n)) pairwise non-isomorphic n-vertex graphs.
Název v anglickém jazyce
TWIN-WIDTH AND PERMUTATIONS
Popis výsledku anglicky
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomasse, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been further extended to binary structures, in several (basically equivalent) ways. We prove that a class of binary relational structures (that is: edge-colored partially directed graphs) has bounded twin-width if and only if it is a first-order transduction of a proper permutation class. As a by-product, we show that every class with bounded twin-width contains at most 2^(O(n)) pairwise non-isomorphic n-vertex graphs.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění
2024
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)