On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a property of families of sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4068746 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4842748 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimum size of 4-uniform hypergraphs without property \(B\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What we know and what we do not know about Turán numbers / rank | |||
Normal rank | |||
Latest revision as of 13:09, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Erdős-Hajnal problem for 3-uniform hypergraphs |
scientific article |
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
