

























Abstract:For a graph $H$ whose edges are coloured blue or red, the $H$-semi-inducibility problem asks for the maximum, over all graphs $G$ of given order $n$, of the number of injections from the vertex set of $H$ into the vertex set of $G$ that send red (resp. blue) edges of $H$ to edges (resp. non-edges) of $G$. We consider all possible 4-vertex non-complete graphs $H$ and essentially resolve all remaining cases except when $H$ is the 3-edge path coloured blue-blue-red in this order (or is equivalent to this case). Some of our proofs are computer-generated, using the flag algebra method of Razborov.
From: Levente Bodnar [view email]
[v1]
Tue, 28 Oct 2025 11:57:53 UTC (3,214 KB)
[v2]
Wed, 27 May 2026 09:05:37 UTC (3,213 KB)
[v3]
Mon, 15 Jun 2026 09:39:31 UTC (3,213 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。