arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.08347math.CO
收藏

跟踪线图数量

Track number of line graphs

Deepak Rajendraprasad

摘要:

图$G$的轨道数$τ(G)$是其并集为$G$的区间图的最小数目。证明了无三角形图$G$的线图$L(G)$的迹数至少为$\lg \lg χ(G) + 1$,其中$χ(G)$是$G$的色数.使用这个下界和文献中的两个经典拉姆齐理论结果,我们回答了Milans,Stolee和West [J. Combinatorics,2015](MSW15)提出的两个问题。首先证明了完全图$K_n$的线图的迹数$τ(L(K_n))$至少为$\lg\lg n - o(1)$。这是渐近紧的,并且它改进了MSW15中的$Ω(\lg\lg n/ \lg\lg\lg n)$的界。接下来我们证明了对于图族$\mathcal{G}$,$\{τ(L(G)):G \in \mathcal{G}\}$是有界的当且仅当$\{χ(G):G \in \mathcal{G}\}$是有界的.这证实了MSW15中的一个猜想。我们所有的下界适用,即使扩大覆盖家庭从家庭的区间图的家庭弦图。

英文摘要:

The track number $τ(G)$ of a graph $G$ is the minimum number of interval graphs whose union is $G$. We show that the track number of the line graph $L(G)$ of a triangle-free graph $G$ is at least $\lg \lg χ(G) + 1$, where $χ(G)$ is the chromatic number of $G$. Using this lower bound and two classical Ramsey-theoretic results from literature, we answer two questions posed by Milans, Stolee, and West [J. Combinatorics, 2015] (MSW15). First we show that the track number $τ(L(K_n))$ of the line graph of the complete graphs $K_n$ is at least $\lg\lg n - o(1)$. This is asymptotically tight and it improves the bound of $Ω(\lg\lg n/ \lg\lg\lg n)$ in MSW15. Next we show that for a family of graphs $\mathcal{G}$, $\{τ(L(G)):G \in \mathcal{G}\}$ is bounded if and only if $\{χ(G):G \in \mathcal{G}\}$ is bounded. This affirms a conjecture in MSW15. All our lower bounds apply even if one enlarges the covering family from the family of interval graphs to the family of chordal graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑