Path-Star Graph Problem

• The path-star graph problem is a theoretical framework that unifies paths and stars, analyzing forbidden configurations in graphs through extremal and spectral methods.
• It characterizes Turán numbers and maximum spectral radii by partitioning cases into regimes driven by the balance between path and star substructures.
• The study also extends to algorithmic recognition via star-PCG representations and Ore-type theorems, offering practical insights for complex graph analysis.

The path-star graph problem encompasses a collection of questions concerning the structure, extremal properties, and spectral characteristics of graphs and graph families that combine path and star subgraphs. This theoretical landscape provides a unifying framework for Turán-type extremal questions, spectral extremal graph theory, and structural graph theory centered on mixtures of paths and stars, commonly referred to as "path-star forests." The problem domain includes classical edge-extremal, spectral, and order-theoretic constraints on graphs that avoid prescribed combinations of paths and stars as (not necessarily induced) subgraphs, as well as characterizing configurations that optimize or avoid these forbidden structures.

1. Definitions and Core Notation

A path of order $\ell$ is denoted $P_\ell$, a tree on $\ell$ vertices of maximum degree 2. A star $S_a$ is $K_{1,a}$, a tree on $a+1$ vertices with one central vertex of degree $a$ joined to $a$ leaves. A linear forest is any disjoint union of paths; a star forest is a disjoint union of stars. A path-star forest $F$ is defined as

$$F = \bigcup_{i=1}^p P_{\ell_i}\;\cup\;\bigcup_{j=1}^q S_{a_j}$$

with $P_\ell$0 and $P_\ell$1. The Turán number $P_\ell$2 is the maximum number of edges in an $P_\ell$3-vertex graph that is $P_\ell$4-free. The spectral radius $P_\ell$5 of a graph $P_\ell$6 is the largest eigenvalue of its adjacency matrix. For extremal spectral questions, forbidding star-path forests determines the maximum $P_\ell$7 for $P_\ell$8-vertex $P_\ell$9-free graphs (Zhai et al., 2023, Fang et al., 2023).

2. Turán Numbers for Path-Star Forests

For sufficiently large $\ell$0, the Turán number $\ell$1 for an arbitrary path-star forest $\ell$2 is characterized by a dichotomy of regimes:

• Regime I ("paths $\ell$3 stars"): If

$\ell$4

then

$\ell$5

• Regime II ("pure stars"): If $\ell$6, then

$\ell$7

These cases generalize and recover the classical Turán formulas for linear forests and star forests (Fang et al., 2023).

Extremal Graph Constructions

• In Regime I, the unique extremal graph is $\ell$8, with $\ell$9 any extremal graph for the corresponding pure-path-forest on $S_a$0 vertices.
• In Regime II, the extremal graph is $S_a$1 for the maximizing $S_a$2.

3. Spectral Extremal Results for Forbidden Path-Star Forests

Given $S_a$3 a (path, star, or path-star) forest, let $S_a$4 denote the family of $S_a$5-vertex $S_a$6-free graphs maximizing the spectral radius. For several key classes, the maximal $S_a$7 is exactly achieved by the same extremal graphs as in the Turán (edge-count) sense:

• For

$S_a$8

and $S_a$9 sufficiently large, the unique extremal graphs are the join $K_{1,a}$0 with $K_{1,a}$1, or $K_{1,a}$2 (one edge added in the independent part) for odd $K_{1,a}$3.

• For $K_{1,a}$4 and $K_{1,a}$5, one gets $K_{1,a}$6 or $K_{1,a}$7 plus a single extra edge as the unique extremal constructions.

The proofs use Rayleigh-quotient arguments on the Perron vector, eigenvalue-interlacing, the Hong–Shu–Fang bound, and rely crucially on structural features of join graphs (Zhai et al., 2023).

4. Ore-Type Path-Star Theorems (Hamiltonian Paths vs. Induced Stars)

The path-star graph problem in the context of Hamiltonicity is encapsulated by sharp Ore-type results: For any $K_{1,a}$8, a connected graph $K_{1,a}$9 of order $a+1$0 with $a+1$1 (where $a+1$2 is the minimum degree-sum of two nonadjacent vertices) must have either a Hamiltonian path or an induced copy of $a+1$3. This threshold is best possible and is witnessed by the bipartite extremal graphs $a+1$4. At equality, the extremal graphs are joins $a+1$5, and the structure theorem describes the precise forbidden configurations (Choi et al., 2020).

5. Structural and Recognition Aspects

The study of star-path and path-star configurations extends beyond extremal and spectral theory to algorithmic graph theory. The characterization of star pairwise compatibility graphs (star-PCGs) provides an explicit structural recognition scheme:

• A graph $a+1$6 admits a "star-PCG" representation (there exists a weighting of a star tree and distance thresholds giving $a+1$7 as the threshold graph) if and only if $a+1$8 admits a linear, "gap-free" vertex ordering. Efficient ($a+1$9 worst-case) recognition is possible through consecutive and contiguous orderings of relevant set systems, PQ-tree frameworks, and interval-core decompositions (Xiao et al., 2018).

6. Broader Implications and Open Problems

The path-star graph problem reveals a robust structural dichotomy in extremal graph theory: for broad combinations of paths and stars, both the edge-maximal and spectral-maximal graphs are precisely joins of cliques with independent sets, possibly plus local corrections. This indicates a deep interplay between the presence of long paths and high-degree vertices (star centers), yielding universal constructions for forbidden path-star subgraphs.

Many open problems remain:

• Determining exact thresholds and uniqueness criteria for spectral extremal graphs as $a$0 varies and as more general path-star forests are forbidden (Zhai et al., 2023).
• Developing comprehensive "spectral-Turán" dictionaries for all acyclic graphs (Zhai et al., 2023).
• Extending Turán and Ore-type theory to induced-subgraph settings (e.g., for arbitrary induced star-path mixtures) and to directed or weighted settings.

7. Representative Examples and Special Cases

Path-Star Structure	Extremal Graph Construction	Reference
$a$1 (single long path)	Union of $a$2-cliques	(Fang et al., 2023)
Star forest $a$3	$a$4	(Fang et al., 2023, Zhai et al., 2023)
$a$5	$a$6 (see main text)	(Fang et al., 2023)
$a$7	$a$8	(Zhai et al., 2023)
$a$9 (Hamiltonicity criteria)	$a$0, $a$1	(Choi et al., 2020)

The landscape of the path-star graph problem synthesizes edge, spectral, and order-theoretic perspectives, offering a blueprint for the interaction of long "linear" and "hubbed" substructures in extremal graph theory.