Twin-width can be exponential in treewidth - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2023

Twin-width can be exponential in treewidth

Résumé

For any small positive real ε and integer t > 1 ε , we build a graph with a vertex deletion set of size t to a tree, and twin-width greater than 2 (1−ε)t. In particular, this shows that the twin-width is sometimes exponential in the treewidth, in the so-called oriented twin-width and grid number, and that adding an apex may multiply the twin-width by at least 2 − ε. Except for the one in oriented twin-width, these lower bounds are essentially tight.
Fichier principal
Vignette du fichier
main.pdf (537.3 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04292973 , version 1 (17-11-2023)

Identifiants

  • HAL Id : hal-04292973 , version 1

Citer

Edouard Bonnet, Hugues Déprés. Twin-width can be exponential in treewidth. Journal of Combinatorial Theory, Series B, 2023. ⟨hal-04292973⟩
15 Consultations
22 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More