Edge colourings of graphs avoiding monochromatic matchings of a given size
type: Item
instance of: scholarly article
zbMATH Open document ID: 1241.05054
DOI: 10.1017/S0963548311000484
author: Carlos Hoppen
author: Yoshiharu Kohayakawa
author: Hanno Lefmann
published in: Combinatorics, Probability and Computing
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6034358
zbMATH Keywords: extremal graphs
MaRDI profile type: Publication
Wikidata QID: Q105583909
cites work: On Colourings of Hypergraphs Without Monochromatic Fano Planes
cites work: On the structure of linear graphs
cites work: On maximal paths and circuits of graphs
cites work: A structural result for hypergraphs with many restricted edge colorings
cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
cites work: Q4879181
cites work: A remark on the number of edge colorings of graphs
full work available at URL: s0963548311000484
OpenAlex ID: W2024235935
title: Edge colourings of graphs avoiding monochromatic matchings of a given size
description: scientific article; zbMATH DE number 6034358