Monochromatic matchings in the shadow graph of almost complete hypergraphs
type: Item
instance of: scholarly article
title: Monochromatic matchings in the shadow graph of almost complete hypergraphs
zbMATH Open document ID: 1235.05051
author: András Gyárfás
author: Gábor N. Sárközy
author: Endre Szemerédi
published in: Annals of Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5999746
zbMATH Keywords: colored complete uniform hypergraphs
zbMATH Keywords: monochromatic matchings
MaRDI profile type: Publication
full work available at URL: s00026-010-0058-1
OpenAlex ID: W2059402221
cites work: Q5668821
cites work: The Ramsey number for a triple of long even cycles
cites work: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
cites work: Three-color Ramsey numbers for paths
cites work: The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
cites work: The Ramsey number for hypergraph cycles. I.
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\)
DOI: 10.1007/S00026-010-0058-1
Recommended article: Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Recommended article: On matchings in hypergraphs
Recommended article: Matchings with few colors in colored complete graphs and hypergraphs
Recommended article: On shadowed hypergraphs
Recommended article: Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
Recommended article: Multicolored matchings in hypergraphs
Recommended article: Matchings in hypergraphs and Castelnuovo--Mumford regularity
Recommended article: Nearly Perfect Matchings in Uniform Hypergraphs
Recommended article: Nearly perfect matchings in regular simple hypergraphs
Recommended article: Q5241134
description: scientific article; zbMATH DE number 5999746