A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number

Autor:	Pilipczuk, Marcin, Rzążewski, Paweł
Rok vydání:	2023
Předmět:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2310.11573 Zobrazit plný text záznamu View this record from Arxiv