Branchwidth is (1,g)-self-dual
Combinatorics
2023-06-06 v2
Abstract
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the branchwidth of connected hypergraphs without bridges and loops that are embeddable in some surface of Euler genus at most g is an (1,g)-self-dual parameter. This is the first proof that branchwidth is an additively self-dual width parameter.
Cite
@article{arxiv.2305.18069,
title = {Branchwidth is (1,g)-self-dual},
author = {Georgios Kontogeorgiou and Alexandros Leivaditis and Kostas I. Psaromiligkos and Giannos Stamoulis and Dimitris Zoros},
journal= {arXiv preprint arXiv:2305.18069},
year = {2023}
}
Comments
10 pages