Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
type: Item
instance of: scholarly article
title: Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
zbMATH Open document ID: 1378.05048
author: Sebastián Bustamante
author: Hiệp Hàn
author: Maya Stein
publication date: 2018-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6827174
zbMATH Keywords: monochromatic cycle partitioning
zbMATH Keywords: tight cycles
MaRDI profile type: Publication
full work available at URL: j.endm.2017.06.037
OpenAlex ID: W2742418291
cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
cites work: An improved bound for the monochromatic cycle partition number
cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
cites work: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
cites work: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths
cites work: Improved monochromatic loose cycle partitions in hypergraphs
DOI: 10.1016/J.ENDM.2017.06.037
Recommended article: Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles
Recommended article: Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
Recommended article: Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Recommended article: Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
Recommended article: Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
Recommended article: Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Recommended article: Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
Recommended article: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
Recommended article: Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Recommended article: Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
description: scientific article; zbMATH DE number 6827174