Edge-coloured complete graphs: Connectedness of some subgraphs (Q1120587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4101218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-coloured complete graphs: Connectedness of some subgraphs |
scientific article; zbMATH DE number 4101218 |
Statements
Edge-coloured complete graphs: Connectedness of some subgraphs (English)
0 references
1987
0 references
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.
0 references
edge colouring
0 references
monochromatic separating edge set
0 references
0.8343563079833984
0 references
0.8256388306617737
0 references
0.8163654804229736
0 references
0.8067000508308411
0 references
