Long monochromatic Berge cycles in colored 4-uniform hypergraphs
type: Item
instance of: scholarly article
title: Long monochromatic Berge cycles in colored 4-uniform hypergraphs
zbMATH Open document ID: 1221.05141
author: András Gyárfás
author: Gábor N. Sárközy
author: Endre Szemerédi
published in: Graphs and Combinatorics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5815421
zbMATH Keywords: colored complete uniform hypergraphs
zbMATH Keywords: monochromatic Hamiltonian Berge-cycles
MaRDI profile type: Publication
full work available at URL: s00373-010-0908-y
OpenAlex ID: W2132759301
cites work: Q5668821
cites work: Highly connected monochromatic subgraphs
cites work: Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
cites work: All Ramsey numbers for cycles in graphs
cites work: The Ramsey number for a triple of long even cycles
cites work: Three-color Ramsey numbers for paths
cites work: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
cites work: The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
cites work: Monochromatic matchings in the shadow graph of almost complete hypergraphs
cites work: The Ramsey number for hypergraph cycles. I.
cites work: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs
cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
DOI: 10.1007/S00373-010-0908-Y
description: scientific article; zbMATH DE number 5815421