On graphs with a large number of edge-colorings avoiding a rainbow triangle

Author:

Hoppen Carlos,Lefmann Hanno,Odermann Knut

Funder

CAPES

DAAD

FAPERGS

CNPq

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference18 articles.

1. The number of edge colorings with no monochromatic cliques;Alon;J. Lond. Math. Soc.,2004

2. A remark on the number of edge colorings of graphs;Balogh;European J. Combin.,2006

3. Edge-colorings of graphs avoiding complete graphs with a prescribed coloring;Benevides;Discrete Math.,2017

4. Some new applications of probability methods to combinatorial analysis and graph theory;Erdős;Congr. Numer.,1974

5. V. Falgas-Ravry, K. O’Connell, J. Strömberg, A. Uzzell, Multicolour containers and the entropy of decorated graph limits, arXiv:1607.08152.

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Edge-colorings avoiding patterns in a triangle;Discrete Mathematics;2024-04

2. Integer colorings with forbidden rainbow sums;Journal of Combinatorial Theory, Series A;2023-10

3. Disproof of a conjecture on the rainbow triangles in arc-colored digraphs;Discrete Applied Mathematics;2023-01

4. Integer colorings with no rainbow k-term arithmetic progression;European Journal of Combinatorics;2022-08

5. Extremal problems and results related to Gallai-colorings;Discrete Mathematics;2021-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3