On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004)
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: On the Erdős-Hajnal problem for 3-uniform hypergraphs |
scientific article; zbMATH DE number 6274268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Erdős-Hajnal problem for 3-uniform hypergraphs |
scientific article; zbMATH DE number 6274268 |
Statements
On the Erdős-Hajnal problem for 3-uniform hypergraphs (English)
0 references
26 March 2014
0 references
Let \(m(n,r)\) be the minimum possible number of the edges in an \(n\)-uniform hypergraph with the chromatic number greater than \(r\). Determining the number \(m(n,r)\) is the classical Erdős-Hajnal problem. In this paper the author shows that \(27\leq m(3,3)\leq 35.\)
0 references
hypergraph
0 references
\(n\)-uniform hypergraph
0 references
coloring
0 references
0 references
0.9552307
0 references
0.92708427
0 references
0.92307436
0 references
0.9169879
0 references
0.9164337
0 references
0.9131787
0 references
0.9119921
0 references
0.9059811
0 references
0.90567875
0 references
0 references
