Note on highly connected monochromatic subgraphs in 2-colored complete graphs
type: Item
instance of: scholarly article
title: Note on highly connected monochromatic subgraphs in 2-colored complete graphs
zbMATH Open document ID: 1205.05090
author: Shinya Fujita
author: Colton Magnant
published in: The Electronic Journal of Combinatorics
publication date: 2011-02-17T00:00:00Z
full work available at URL: https://eudml.org/doc/223488
full work available at URL: v18i1p15.html
review text: Summary: We improve upon some recent results concerning the existence of large monochromatic, highly connected subgraphs in a 2-coloring of a complete graph. In particular, we show that if \(n \geq 6.5(k - 1)\), then in any 2-coloring of the edges of \(K_n\), there exists a monochromatic \(k\)-connected subgraph of order at least \(n - 2(k - 1)\). Our result improves upon several recent results by a variety of authors.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5852465
zbMATH Keywords: large monochromatic subgraphs
zbMATH Keywords: highly connected subgraphs
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5852465