Lower bounds for the number of edges in hypergraphs of certain classes
type: Item
instance of: scholarly article
title: Lower bounds for the number of edges in hypergraphs of certain classes
zbMATH Open document ID: 1273.05158
DOI: 10.1134/S1064562410050078
published in: Doklady Mathematics
publication date: 2011-03-17T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 5866979
author: D. A. Shabanov
MaRDI profile type: Publication
cites work: Improved bounds and algorithms for hypergraph 2-coloring
cites work: On the chromatic number of finite systems of subsets
cites work: Coloring uniform hypergraphs with few colors
cites work: Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
cites work: On 3-chromatic hypergraphs
cites work: Coloring n-sets red and blue
cites work: Coloring H-free hypergraphs
cites work: On the chromatic number of set systems
cites work: Coloring uniform hypergraphs with few edges
full work available at URL: s1064562410050078
OpenAlex ID: W1983293242
description: scientific article; zbMATH DE number 5866979