游林,王天明.猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例(英文)[J].数学研究及应用,2002,22(2):194~196 |
猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例(英文) |
Counter-Examples to the Conjecture M(2k, k + 1) = 3k - 1 + [(k-1)/2] |
投稿时间:2000-03-05 |
DOI:10.3770/j.issn:1000-341X.2002.02.005 |
中文关键词: |
英文关键词:jump number (0 1)-matrices conjecture counter-examples |
基金项目: |
|
摘要点击次数: 2621 |
全文下载次数: 1186 |
中文摘要: |
Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例. |
英文摘要: |
The maxinmum jump number M(n, k) over a class of n×n matrices of zerosand ones with constant row and column sum k has been investigated by Brualdi andJung in [1] where they proposed the conjecture M(2k, k + 1) = 3k - 1 + [(k-1)/2]. In this note, we give two counter-examples to this conjecture. |
查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|