ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES

Lang Richard; Schaudt Oliver; Stein Maya

首页> 外文期刊>SIAM Journal on Discrete Mathematics >ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES

【24h】

ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES

机译：几乎将3边色的Kn，n划分为五个单色循环

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We show that for any coloring of the edges of the complete bipartite graph K-n,K-n with three colors there are five disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 disjoint monochromatic cycles together cover all vertices.

机译：我们显示出，对于具有三色的完整二部图K-n，K-n的边缘的任何着色，都有五个不相交的单色循环，它们一起覆盖了除o（n）以外的所有顶点。在相同情况下，18个不相交的单色循环一起覆盖所有顶点。

著录项

来源
《SIAM Journal on Discrete Mathematics》 |2017年第2期|1374-1402|共29页
作者
Lang Richard; Schaudt Oliver; Stein Maya;
展开▼
作者单位

Univ Chile, Dept Math Engn, Santiago, Chile;

Univ Cologne, Inst Informat, Cologne, Germany;

Univ Chile, Dept Math Engn, Santiago, Chile;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
monochromatic cycle partition; Ramsey-type problem; complete bipartite graph;

机译：单色循环分割拉姆西型问题完全二部图;

相似文献

外文文献
中文文献
专利

1. COVERING 3-EDGE-COLORED RANDOM GRAPHS WITH MONOCHROMATIC TREES [J] . Kohayakawa Yoshiharu, Mendonca Walner, Mota Guilherme Oliveira, SIAM Journal on Discrete Mathematics . 2021,第2期

机译：用单色树木覆盖3埃边色随机图
2. PARTITIONING EDGE-COLORED HYPERGRAPHS INTO FEW MONOCHROMATIC TIGHT CYCLES [J] . Bustamante Sebastian, Corsten Jan, Frankl Nora, SIAM Journal on Discrete Mathematics . 2020,第2期

机译：将边缘彩色的超照片分区为几个单色紧密循环
3. Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles [J] . Bustamante Sebastian, Han Hiep, Stein Maya Journal of Graph Theory . 2019,第1a2期

机译：几乎将2色完整的3均匀的超照片分成两个单色紧密或松散的循环
4. Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles [C] . Fabrice Talla Nobibon, Cor Hurkens, Roel Leus, Algorithmic aspects in information and management . 2010

机译：避免单色循环的同时为图形着色的精确算法
5. Edge-color balance with respect to a partition of the vertices of Kn. [D] . Clark, Sally Ann. 2003

机译：相对于Kn顶点的分区的边缘颜色平衡。
6. Optimization of a Relative Telomere Length Assay by Monochromatic Multiplex Real-Time Quantitative PCR on the LightCycler 480 [O] . Anthony Y.Y. Hsieh, Sara Saberi, Abhinav Ajaykumar, 2016

机译：在LightCycler 480上通过单色多重实时定量PCR优化相对端粒长度测定
7. Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition [O] . Xueliang Li, Fengxia Liu 2008

机译：在色度条件下通过单色树分隔3边缘彩色的完整平等图。
8. High temperature, low-cycle fatigue of copper-base alloys for rocket nozzles. Part 2: Strainrange partitioning and low-cycle fatigue results at 538 deg C [R] . Conway, J. B., Stentz, R. H., Berling, J. T. 1976

机译：用于火箭喷嘴的铜基合金的高温，低周疲劳。第2部分：strainrange分配和低周疲劳结果在538摄氏度

ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES

摘要

著录项

相似文献

相关主题

期刊订阅