Upper bound in the Erdős-Hajnal problem of hypergraph coloring
From MaRDI portal
Publication:1947784
DOI10.1134/S0001434613010197zbMATH Open1276.05047OpenAlexW2073472609MaRDI QIDQ1947784FDOQ1947784
Authors: S. M. Teplyakov 
Publication date: 26 April 2013
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434613010197
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
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Extremal problems for colourings of uniform hypergraphs
- On a property of families of sets
- Color-critical graphs and hypergraphs with few edges: a survey
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- On two-colorings of hypergraphs
Cited In (7)
- 2-colorings of hypergraphs with large girth
- On algorithmic methods of analysis of two-colorings of hypergraphs
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- Title not available (Why is that?)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
- Letter to the editor
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)
