Upper bound in the Erdős-Hajnal problem of hypergraph coloring
type: Item
instance of: scholarly article
title: Upper bound in the Erdős-Hajnal problem of hypergraph coloring
zbMATH Open document ID: 1276.05047
DOI: 10.1134/S0001434613010197
author: S. M. Teplyakov
published in: Mathematical Notes
publication date: 2013-04-26T00:00:00Z
review text: This paper deals with the quantity \(m_k (n)\), the least number of edges of an \(n\)-homogeneous hypergraph whose vertices cannot be two colored in such a way that every edge contains at least \(k\) vertices of each color class. The bound for \(m_ k(n)\) obtained in [\textit{D. A. Shabanov}, Izv. Math. 71, No. 6, 1253--1290 (2007); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 71, No. 6, 183--222 (2007; Zbl 1247.05116)] is obtained here under weaker assumptions on \(k\).
reviewed by: Brigitte Servatius
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6158174
zbMATH Keywords: hypergraph coloring
MaRDI profile type: Publication
cites work: On a property of families of sets
cites work: Q5477816
cites work: On one combinatorial problem of Erdös
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: On two-colorings of hypergraphs
cites work: Extremal problems for colourings of uniform hypergraphs
cites work: On general two-colorings of uniform hypergraphs
full work available at URL: s0001434613010197
OpenAlex ID: W2073472609
Recommended article: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
Recommended article: An upper bound for total colouring of graphs
Recommended article: Approximability of the upper chromatic number of hypergraphs
Recommended article: A new upper bound for total colourings of graphs
Recommended article: Extremal problems in hypergraph colourings
Recommended article: Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
Recommended article: Q4842710
Recommended article: Q4294632
Recommended article: Extremal problems for colourings of uniform hypergraphs
Recommended article: Upper bounds for the achromatic and coloring numbers of a graph
description: scientific article; zbMATH DE number 6158174