Probabilistic methods in coloring and decomposition problems

Noga Alon

doi:10.1016/0012-365X(92)00465-4

Probabilistic methods in coloring and decomposition problems

Noga Alon

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

15 Scopus citations

Abstract

Numerous problems in graph theory and combinatorics can be formulated in terms of the existence of certain colorings of graphs or hypergraphs. Many of these problems can be solved or partially solved by applying probabilistic arguments. In this paper we discuss several examples that illustrate the methods used. This is mainly a survey paper, but it contains some new results as well.

Original language	English (US)
Pages (from-to)	31-46
Number of pages	16
Journal	Discrete Mathematics
Volume	127
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(92)00465-4
State	Published - Mar 15 1994
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(92)00465-4

Cite this

@article{030b5008f9044ffdac95f64528ba4cb3,

title = "Probabilistic methods in coloring and decomposition problems",

abstract = "Numerous problems in graph theory and combinatorics can be formulated in terms of the existence of certain colorings of graphs or hypergraphs. Many of these problems can be solved or partially solved by applying probabilistic arguments. In this paper we discuss several examples that illustrate the methods used. This is mainly a survey paper, but it contains some new results as well.",

author = "Noga Alon",

year = "1994",

month = mar,

day = "15",

doi = "10.1016/0012-365X(92)00465-4",

language = "English (US)",

volume = "127",

pages = "31--46",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Probabilistic methods in coloring and decomposition problems

AU - Alon, Noga

PY - 1994/3/15

Y1 - 1994/3/15

N2 - Numerous problems in graph theory and combinatorics can be formulated in terms of the existence of certain colorings of graphs or hypergraphs. Many of these problems can be solved or partially solved by applying probabilistic arguments. In this paper we discuss several examples that illustrate the methods used. This is mainly a survey paper, but it contains some new results as well.

AB - Numerous problems in graph theory and combinatorics can be formulated in terms of the existence of certain colorings of graphs or hypergraphs. Many of these problems can be solved or partially solved by applying probabilistic arguments. In this paper we discuss several examples that illustrate the methods used. This is mainly a survey paper, but it contains some new results as well.

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

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

U2 - 10.1016/0012-365X(92)00465-4

DO - 10.1016/0012-365X(92)00465-4

M3 - Article

AN - SCOPUS:38149146930

SN - 0012-365X

VL - 127

SP - 31

EP - 46

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Probabilistic methods in coloring and decomposition problems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this