Upper bound in the Erdős-Hajnal problem of hypergraph coloring
From MaRDI portal
Publication:1947784
Recommendations
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- An upper bound for total colouring of graphs
- Approximability of the upper chromatic number of hypergraphs
- A new upper bound for total colourings of graphs
- Extremal problems in hypergraph colourings
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
- scientific article; zbMATH DE number 786134
- scientific article; zbMATH DE number 568840
- Extremal problems for colourings of uniform hypergraphs
- Upper bounds for the achromatic and coloring numbers of a graph
Cites work
- Color-critical graphs and hypergraphs with few edges: a survey
- Extremal problems for colourings of uniform hypergraphs
- On a property of families of sets
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- On two-colorings of hypergraphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(9)- Colorings of hypergraphs with large number of colors
- Letter to the editor
- Combinatorial extremum problems for 2-colorings of hypergraphs
- On algorithmic methods of analysis of two-colorings of hypergraphs
- 2-colorings of hypergraphs with large girth
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- scientific article; zbMATH DE number 3335822 (Why is no real title available?)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947784)
