An improved bound on the minimal number of edges in color-critical graphs (Q1379126): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreidfvt7slzhbl3wxgozaq7tndb2vqffkpeyiar6pqeagcbalym34se / rank | |||
Normal rank | |||
Latest revision as of 11:23, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved bound on the minimal number of edges in color-critical graphs |
scientific article |
Statements
An improved bound on the minimal number of edges in color-critical graphs (English)
0 references
18 February 1998
0 references
Summary: It is proven that for \(k\geq 4\) and \(n>k\) every \(k\)-color-critical graph on \(n\) vertices has at least \(\left(\frac{k-1}{2}+\frac{k-3}{2(k^2-2k-1)}\right)n\) edges, thus improving a result of Gallai from 1963.
0 references
