arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.05028math.CO
收藏

加权Turan问题及其应用

Weighted Turan Problems with Applications

Patrick Bennett, Sean English, Maria Talanda-Fisher

摘要:

假设$K_n$的边由权函数$w$分配权重。我们定义{ \em加权极值数} \[ \mathrm{ex}(n,w,F):=\max\{w(G)\mid G\subseteq K_n,\text{ and }G\text{ is }F\text{-free}\} \],其中$w(G):=\sum_{e\in E(G)}w(e)$。在本文中,我们研究这个问题的两种类型的权重$w$,其中每一个都有一个应用程序。第一个应用是在一个完全的多部主机图的极值问题。第二个应用是直径为4的树的最大直线交叉数。

英文摘要:

Suppose the edges of $K_n$ are assigned weights by a weight function $w$. We define the {\em weighted extremal number} \[ \mathrm{ex}(n,w,F):=\max\{w(G)\mid G\subseteq K_n,\text{ and }G\text{ is }F\text{-free}\} \] where $w(G):=\sum_{e\in E(G)}w(e)$. In this paper we study this problem for two types of weights $w$, each of which has an application. The first application is to an extremal problem in a complete multipartite host graph. The second application is to the maximum rectilinear crossing number of trees of diameter 4.

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

↑