On a bound in extremal combinatorics
type: Item
instance of: scholarly article
title: On a bound in extremal combinatorics
zbMATH Open document ID: 1390.05151
DOI: 10.1134/S1064562418010155
author: A. A. Sagdeev
author: Andrei M. Raigorodskii
published in: Doklady Mathematics
publication date: 2018-06-20T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 6892222
zbMATH Keywords: maximum number of edges in a hypergraph
MaRDI profile type: Publication
cites work: New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
cites work: On the chromatic numbers of low-dimensional spaces
cites work: On random subgraphs of Kneser and Schrijver graphs
cites work: Improvements of the Frankl-Rödl theorem and geometric consequences
cites work: Intersection theorems with geometric consequences
cites work: On the maximal number of edges in a uniform hypergraph with one forbidden intersection
cites work: On lower bounds for the chromatic number of sphere
cites work: New lower bound for the chromatic number of a rational space with one and two forbidden distances
cites work: Q492207
cites work: The realization of distances within sets in Euclidean space
cites work: On the chromatic number of a space
full work available at URL: s1064562418010155
OpenAlex ID: W2792490967
description: scientific article; zbMATH DE number 6892222