An improved bound on the minimal number of edges in color-critical graphs

Michael Krivelevich

An improved bound on the minimal number of edges in color-critical graphs

Michael Krivelevich^*

^*Corresponding author for this work

Institute for Advanced Studies

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

It is proven that for k ≥ 4 and n > k every k-color-critical graph on n vertices has at least (k-1/2 + k-3/2(k²-2k-1)) n edges, thus improving a result of Gallai from 1963.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	5
Issue number	1
State	Published - 1998
Externally published	Yes

Cite this

@article{61a03625f0104e13ac6a7766bf15caa3,

title = "An improved bound on the minimal number of edges in color-critical graphs",

abstract = "It is proven that for k ≥ 4 and n > k every k-color-critical graph on n vertices has at least (k-1/2 + k-3/2(k2-2k-1)) n edges, thus improving a result of Gallai from 1963.",

author = "Michael Krivelevich",

year = "1998",

language = "אנגלית",

volume = "5",

journal = "Electronic Journal of Combinatorics",

issn = "1097-1440",

publisher = "Australian National University",

number = "1",

}

TY - JOUR

T1 - An improved bound on the minimal number of edges in color-critical graphs

AU - Krivelevich, Michael

PY - 1998

Y1 - 1998

N2 - It is proven that for k ≥ 4 and n > k every k-color-critical graph on n vertices has at least (k-1/2 + k-3/2(k2-2k-1)) n edges, thus improving a result of Gallai from 1963.

AB - It is proven that for k ≥ 4 and n > k every k-color-critical graph on n vertices has at least (k-1/2 + k-3/2(k2-2k-1)) n edges, thus improving a result of Gallai from 1963.

UR - https://www.scopus.com/pages/publications/10044275447

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:10044275447

SN - 1097-1440

VL - 5

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

An improved bound on the minimal number of edges in color-critical graphs

Abstract

Other files and links

Fingerprint

Cite this