Search arXivSearch

arXiv · 2606.23351

Fixed-density profiles for the semi-induced 4-vertex star

Abstract

We study the fixed-density semi-inducibility profiles of the red-blue star $S_{2,1}$, which has one distinguished center, two red edges and one blue edge. For an $n$-vertex graph $G$, let $N(S_{2,1},G)$ be the number of injective labeled copies in which the two red edges of $S_{2,1}$ are mapped to edges of $G$ and its blue edge is mapped to a non-edge of $G$, that is, \begin{align*} N(S_{2,1},G)= \sum_{v\in V(G)} d(v)(d(v)-1)(n-1-d(v)). \end{align*} For every fixed red edge density $β\in[0,1]$, we determine both extremal $S_{2,1}$-densities. On the upper side, we prove the missing low-density range and, together with the theorem of Balogh, Lidický, Mubayi, Pfender and Volec for $β\ge 1/4$, obtain the full four-branch profile predicted in their work. On the lower side, we show that the natural endpoint profile coming from the quasi-star and quasi-clique constructions is not universal; the correct minimum is given by a one-parameter three-class complement-split family. The proofs use a transfer argument with degree-square tie-breaking, reducing the extremal analysis to almost-regular, threshold and finite-staircase optimizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jinghua Deng, Jianfeng Hou. 2026-06-22. Fixed-density profiles for the semi-induced 4-vertex star. https://arxiv.org/abs/2606.23351

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO