Probabilistic methods in coloring and decomposition problems (Q1322212)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic methods in coloring and decomposition problems |
scientific article; zbMATH DE number 562617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic methods in coloring and decomposition problems |
scientific article; zbMATH DE number 562617 |
Statements
Probabilistic methods in coloring and decomposition problems (English)
0 references
5 May 1994
0 references
Several examples are discussed that illustrate how probabilistic arguments can be used to solve combinatorial problems for graphs and hypergraphs.
0 references
coloring
0 references
decomposition
0 references
Ramsey numbers
0 references
chromatic index
0 references
arboricity
0 references
algorithms
0 references
hypergraphs
0 references
0 references
0.91765034
0 references
0.9167528
0 references
0.90295905
0 references
0.8977346
0 references
