星与路的不交并的极值图
Extremal graphs for disjoint union of stars and paths
首次发表
浏览论文内容
中文总结 AI 辅助
本文针对足够大的n，刻画了F为路与星不交并时n阶边数最多的F-无图，推广了已有相关研究结果。
中文摘要 AI 辅助
设F为一个图，若图G不含F作为子图，则称G是F-无的。记EX(n,F)为n阶且边数最多的F-无图的集合。本文对足够大的n，刻画了F为路与星的不交并时EX(n,F)中的图，这推广了文献\uc0b7LLP中的结果。
英文摘要
Let $F$ be a graph. A graph $G$ is called $F$-free if $G$ does not contain $F$ as a subgraph. Let ${\rm EX}(n,F)$ denote the set of $F$-free graphs of order $n$ with the maximum edges. In this paper, we characterize the graphs in ${\rm EX}(n,F)$ for large $n$, where $F$ is the disjoint union of paths and stars. This generalizes a result in \cite{LLP}.
