Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles-Reference-Cited by-同舟云学术

Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles

Author:

Bustamante Sebastián¹,Hàn Hiêp²,Stein Maya³^ORCID

Affiliation:

1. Departmento de Ingeniería Matemática; Universidad de Chile; Santiago Chile

2. Departamento de Matemática y Ciencia de la Computación; Universidad de Santiago de Chile; Santiago Chile

3. Departmento de Ingeniería Matemática y Centro de Modelamiento Matemático (UMI 2807 CNRS); Universidad de Chile; Santiago Chile

Funder

Comisión Nacional de Investigación Científica y Tecnológica

Millenium Nucleus Information and Coordination in Networks

Fondo Nacional de Desarrollo Científico y Tecnológico

FONDECYT Regular

CONICYT + PIA/Apoyo a centros científicos y tecnológicos de excelencia con financiamiento Basal, Código

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

Reference17 articles.

2. Sur la existence de deux cycles supplémentaires unicolores, disjoints et de couleurs différentes dans un graphe complet bicolore

4. Extremal problems on set systems;Frankl;Random Struct. Algor.,2002

5. Monochromatic structures in edge-coloured graphs and hypergraphs-A survey;Fujita;Int. J. Graph Theory Appl.,2015

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

3. Towards Lehel's Conjecture for 4-Uniform Tight Cycles;The Electronic Journal of Combinatorics;2023-01-13

4. Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023