Edge-coloured complete graphs: Connectedness of some subgraphs
type: Item
instance of: scholarly article
title: Edge-coloured complete graphs: Connectedness of some subgraphs
zbMATH Open document ID: 0673.05034
DOI: 10.1016/0012-365X(87)90124-5
author: Adam Idzik
author: Jan Komar
author: Marcin Malawski
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: The main result of the paper is as follows: If the edges of the complete graph \(K_ n\) on n vertices are coloured in such a way that there is no monochromatic separating edge set, then there is a monotone sequence \(K_ m\) of complete subgraphs on m vertices for \(m=4,...,n\) so that also \(K_ m\) does not contain a monochromatic separating edge set.
reviewed by: W. Mader
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 4101218
zbMATH Keywords: edge colouring
zbMATH Keywords: monochromatic separating edge set
MaRDI profile type: Publication
cites work: Complete graphs without polychromatic circuits
cites work: Q3853641
cites work: Q4120519
cites work: Parallel concepts in graph theory
full work available at URL: 0012-365x(87)90124-5
OpenAlex ID: W1967508792
description: scientific article; zbMATH DE number 4101218