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

关于冠图的表示数

On the representation number of a crown graph

Marc Glen, Sergey Kitaev, Artem Pyatkin

摘要:

图$G=(V,E)$是词可表示的,如果在字母表$V$上存在词$w$,使得字母$x$和$y$在$w$中交替,当且仅当$xy$是$E$中的边。已知任何词可表示图$G$对于某些$k$是$k$ -词可表示的,即,存在表示$G$的词$w$,使得每个字母在$w$中精确地出现$k$次。这样的最小$k$称为$G$的表示数。冠图$H_{n,n}$是从完全二分图$K_{n,n}$中去除完美匹配而得到的图。本文证明了对于$n\geq 5$,$H_{n,n}$的表示数是$\lceil n/2 \rceil$ .这一结果不仅完全解决了\cite{KL}中的公开问题7.4.2,而且否定了\cite{KL}中问题7.2.7中关于二部图的3-字可表示性的问题.作为副产品,我们获得了一个新的例子,一个高代表性的图形类。

英文摘要:

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy$ is an edge in $E$. It is known that any word-representable graph $G$ is $k$-word-representable for some $k$, that is, there exists a word $w$ representing $G$ such that each letter occurs exactly $k$ times in $w$. The minimum such $k$ is called $G$'s representation number. A crown graph $H_{n,n}$ is a graph obtained from the complete bipartite graph $K_{n,n}$ by removing a perfect matching. In this paper we show that for $n\geq 5$, $H_{n,n}$'s representation number is $\lceil n/2 \rceil$. This result not only provides a complete solution to the open Problem 7.4.2 in \cite{KL}, but also gives a negative answer to the question raised in Problem 7.2.7 in \cite{KL} on 3-word-representability of bipartite graphs. As a byproduct we obtain a new example of a graph class with a high representation number.

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

↑