

























Abstract:Bojańczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-decompositions of bounded width can be produced by a CMSO transduction. We show that in the case of tournaments, a first-order transduction suffices. This implies that the logics CMSO and existential MSO are equivalent over bounded linear clique-width tournaments.
From: Colin Geniet [view email]
[v1]
Tue, 6 Jan 2026 13:23:56 UTC (35 KB)
[v2]
Mon, 15 Jun 2026 07:55:31 UTC (35 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。