Note on highly connected monochromatic subgraphs in 2-colored complete graphs (Q625377): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreick764woe2ljtj76xhgv6b3qj2zvk7shxu3siq67cmr5i5g3rlc5y / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:45, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on highly connected monochromatic subgraphs in 2-colored complete graphs |
scientific article |
Statements
Note on highly connected monochromatic subgraphs in 2-colored complete graphs (English)
0 references
17 February 2011
0 references
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.
0 references
large monochromatic subgraphs
0 references
highly connected subgraphs
0 references
