On the Erdős-Hajnal problem for 3-graphs
From MaRDI portal
Recommendations
- On the Erdős-Hajnal problem for 3-uniform hypergraphs
- scientific article; zbMATH DE number 3924792
- scientific article; zbMATH DE number 4200237
- On the Erdős-Sós conjecture for graphs on n=k+3 vertices.
- On ramsey-tuŕan numbers for 3-graphs
- scientific article; zbMATH DE number 3966110
- On 3^*-connected graphs
- An exact result for 3-graphs
Cites work
- A note on random greedy coloring of uniform hypergraphs
- Colorings of hypergraphs with large number of colors
- Greedy colorings of uniform hypergraphs
- scientific article; zbMATH DE number 3668662 (Why is no real title available?)
- Hypergraphs with high chromatic number
- On a property of families of sets
- Regular behavior of the maximal hypergraph chromatic number
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- The inducibility of graphs
- What we know and what we do not know about Turán numbers
Cited in
(11)- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- The Erdős-Hajnal conjecture for three colors and triangles
- Two Erdős-Hajnal-type theorems in hypergraphs
- On the Erdős-Hajnal problem for 3-uniform hypergraphs
- scientific article; zbMATH DE number 2094794 (Why is no real title available?)
- scientific article; zbMATH DE number 3335822 (Why is no real title available?)
- scientific article; zbMATH DE number 3335823 (Why is no real title available?)
- scientific article; zbMATH DE number 4185602 (Why is no real title available?)
- Erdős-Hajnal problem for \(H\)-free hypergraphs
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- An exact result for 3-graphs
This page was built for publication: On the Erdős-Hajnal problem for 3-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027318)
