中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
  4. 应用数学研究所
Orthogonal matchings revisited

文献类型：期刊论文

作者Qu, Cunquan1; Wang, Guanghui1; Yan, Guiying2
刊名DISCRETE MATHEMATICS
出版日期2015-11-06
卷号338期号:11页码:2080-2088
关键词Regular graphs Orthogonal matchings Rainbow matchings Factors
ISSN号0012-365X
DOI10.1016/j.disc.2015.05.009
英文摘要Let G be a graph on n vertices, which is an edge-disjoint union of ms-factors, that is, s regular spanning subgraphs. Alspach first posed the problem that if there exists a matching M of m edges with exactly one edge from each 2-factor. Such a matching is called orthogonal because of applications in design theory. For s = 2, so far the best known result is due to Stong in 2002, which states that if n >= 3m-2, then there is an orthogonal matching. Anstee and Caccetta also asked if there is a matching M of m edges with exactly one edge from each s-factor? They answered yes for s >= 3. In this paper, we get a better bound and prove that if s = 2 and n >= 2 root 2m+4.5 (note that 2 root 2 <= 2.825), then there is an orthogonal matching. We also prove that if s = 1 and n >= 3.2m - 1, then there is an orthogonal matching, which improves the previous bound (3.79m). (C) 2015 Elsevier B.V. All rights reserved.
资助项目National Natural Science Foundation of China[11101243] ; National Natural Science Foundation of China[11371355] ; Scientific Research Foundation for the Excellent Middle-Aged and Young Scientists of Shandong Province of China[BS2012SF016] ; Shandong University ; Independent Innovation Foundation of Shandong University[IFYT14012]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000358459300026
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/20456]  
专题应用数学研究所
通讯作者Wang, Guanghui
作者单位1.Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 10080, Peoples R China
推荐引用方式
GB/T 7714		 Qu, Cunquan,Wang, Guanghui,Yan, Guiying. Orthogonal matchings revisited[J]. DISCRETE MATHEMATICS,2015,338(11):2080-2088.
APA Qu, Cunquan,Wang, Guanghui,&Yan, Guiying.(2015).Orthogonal matchings revisited.DISCRETE MATHEMATICS,338(11),2080-2088.
MLA Qu, Cunquan,et al."Orthogonal matchings revisited".DISCRETE MATHEMATICS 338.11(2015):2080-2088.

入库方式： OAI收割

来源：数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。