Coloring random graphs

Michael Krivelevich; Benny Sudakov

doi:10.1016/s0020-0190(98)00092-1

Coloring random graphs

Michael Krivelevich, Benny Sudakov^*

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

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

12 Scopus citations

Abstract

We present a randomized polynomial time algorithm that colors almost every graph on n vertices in n/(log₂ n + √log₂n) colors for every positive constant c.

Original language	English
Pages (from-to)	71-74
Number of pages	4
Journal	Information Processing Letters
Volume	67
Issue number	2
DOIs	https://doi.org/10.1016/s0020-0190(98)00092-1
State	Published - 30 Jul 1998

Keywords

Analysis of algorithms
Graph coloring
Random graphs

Access to Document

10.1016/s0020-0190(98)00092-1

Cite this

@article{d93f3bb4d5ca450888b11392f88f8d52,

title = "Coloring random graphs",

abstract = "We present a randomized polynomial time algorithm that colors almost every graph on n vertices in n/(log2 n + √log2n) colors for every positive constant c.",

keywords = "Analysis of algorithms, Graph coloring, Random graphs",

author = "Michael Krivelevich and Benny Sudakov",

year = "1998",

month = jul,

day = "30",

doi = "10.1016/s0020-0190(98)00092-1",

language = "אנגלית",

volume = "67",

pages = "71--74",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Coloring random graphs

AU - Krivelevich, Michael

AU - Sudakov, Benny

PY - 1998/7/30

Y1 - 1998/7/30

N2 - We present a randomized polynomial time algorithm that colors almost every graph on n vertices in n/(log2 n + √log2n) colors for every positive constant c.

AB - We present a randomized polynomial time algorithm that colors almost every graph on n vertices in n/(log2 n + √log2n) colors for every positive constant c.

KW - Analysis of algorithms

KW - Graph coloring

KW - Random graphs

UR - http://www.scopus.com/inward/record.url?scp=0043265885&partnerID=8YFLogxK

U2 - 10.1016/s0020-0190(98)00092-1

DO - 10.1016/s0020-0190(98)00092-1

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

AN - SCOPUS:0043265885

SN - 0020-0190

VL - 67

SP - 71

EP - 74

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Coloring random graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this