On the Erdős-Hajnal problem for 3-uniform hypergraphs
From MaRDI portal
Publication:2440004
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.\)
Recommendations
- On the Erdős-Hajnal problem for 3-graphs
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- On a 3-uniform hypergraph coloring problem in the integers
- A Motzkin-Straus type result for 3-uniform hypergraphs
- On generalized Ramsey numbers for 3-uniform hypergraphs
- On the size of 3-uniform linear hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On the vertex cover number of 3-uniform hypergraph
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs
Cites work
- scientific article; zbMATH DE number 3485832 (Why is no real title available?)
- scientific article; zbMATH DE number 786170 (Why is no real title available?)
- On a property of families of sets
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- What we know and what we do not know about Turán numbers
Cited in
(19)- On the Erdős-Hajnal problem for 3-graphs
- The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
- On the construction of 3-chromatic hypergraphs with few edges
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- Tiling 3-uniform hypergraphs with K₄^3-2e
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
- On the size of 3-uniform linear hypergraphs
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- The size of minimum 3-trees: Cases 3 and 4 mod 6
- scientific article; zbMATH DE number 866666 (Why is no real title available?)
- Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- The intersection spectrum of 3‐chromatic intersecting hypergraphs
- Erdős-Hajnal problem for \(H\)-free hypergraphs
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
- Lower bounds for the number of edges in hypergraphs of certain classes
- The size of minimum 3-trees: Case 2 mod 3
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
This page was built for publication: On the Erdős-Hajnal problem for 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440004)
