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

不在固定图的任何单色副本中的边

Edges not in any monochromatic copy of a fixed graph

Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh

摘要:

对于一个图序列$(H_i)_{i=1}^k$,令$\textrm{nim}(n;H_1,\ldots, H_k)$表示在$(H_i)_{i=1}^k$的所有$k$ -边着色上,对于任何颜色$i$,不包含在颜色$i$中的$H_i$的任何单色副本中的最大边数。当每个$H_i$连通且非二部时,我们引入一个Ramsey数的变体,它决定了$\textrm{nim}(n;H_1,\ldots, H_k)/{n\choose 2}$的极限为$n\to\infty$,并证明了相应的稳定性结果.此外,如果每个$H_i$都是我们所说的\emph{homomorphism-critical}(特别是如果每个$H_i$都是一个团),那么对于所有足够大的$n$,我们精确地确定$\textrm{nim}(n;H_1,\ldots, H_k)$。我们结果的特例$\textrm{nim}(n;K_3,K_3,K_3)$回答了Ma的一个问题.对于二部图,我们主要集中在双色对称的情况下(即,当$k=2$和$H_1=H_2$时)。不难看出,$\textrm{nim}(n;H,H)$至少是$\textrm{ex}(n,H)$,即$n$顶点上的无$H$图的最大尺寸. Keevash和Sudakov表明,平等举行,如果$H$是$4$ -循环和$n$是大的,最近马扩展他们的结果,一个无限家庭的二分图。我们提供了一个更大的二部图族,其中$\textrm{nim}(n;H,H)=\textrm{ex}(n,H)$。对于一般的二部图$H$,我们证明了$\textrm{nim}(n;H,H)$总是在$\textrm{ex}(n,H)$的一个常数加性误差之内,即~ $\textrm{nim}(n;H,H)= \textrm{ex}(n,H)+O_H(1)$。

英文摘要:

For a sequence $(H_i)_{i=1}^k$ of graphs, let $\textrm{nim}(n;H_1,\ldots, H_k)$ denote the maximum number of edges not contained in any monochromatic copy of $H_i$ in colour $i$, for any colour $i$, over all $k$-edge-colourings of~$K_n$. When each $H_i$ is connected and non-bipartite, we introduce a variant of Ramsey number that determines the limit of $\textrm{nim}(n;H_1,\ldots, H_k)/{n\choose 2}$ as $n\to\infty$ and prove the corresponding stability result. Furthermore, if each $H_i$ is what we call \emph{homomorphism-critical} (in particular if each $H_i$ is a clique), then we determine $\textrm{nim}(n;H_1,\ldots, H_k)$ exactly for all sufficiently large~$n$. The special case $\textrm{nim}(n;K_3,K_3,K_3)$ of our result answers a question of Ma. For bipartite graphs, we mainly concentrate on the two-colour symmetric case (i.e., when $k=2$ and $H_1=H_2$). It is trivial to see that $\textrm{nim}(n;H,H)$ is at least $\textrm{ex}(n,H)$, the maximum size of an $H$-free graph on $n$ vertices. Keevash and Sudakov showed that equality holds if $H$ is the $4$-cycle and $n$ is large; recently Ma extended their result to an infinite family of bipartite graphs. We provide a larger family of bipartite graphs for which $\textrm{nim}(n;H,H)=\textrm{ex}(n,H)$. For a general bipartite graph $H$, we show that $\textrm{nim}(n;H,H)$ is always within a constant additive error from $\textrm{ex}(n,H)$, i.e.,~$\textrm{nim}(n;H,H)= \textrm{ex}(n,H)+O_H(1)$.

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

↑