An algorithmic framework for obtaining lower bounds for random Ramsey problems (Q1989950)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6967420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for obtaining lower bounds for random Ramsey problems |
scientific article; zbMATH DE number 6967420 |
Statements
An algorithmic framework for obtaining lower bounds for random Ramsey problems (English)
0 references
29 October 2018
0 references
Ramsey-type problems
0 references
random graphs
0 references
0-statement
0 references
rainbow and properly colored graphs
0 references
anti-Ramsey
0 references
hypergraphs
0 references
0 references
0.9931032061576844
0 references
0.7545782327651978
0 references
0.7484048008918762
0 references
0.7336975932121277
0 references
