Extremal problems for geometric hypergraphs
type: Item
instance of: scholarly article
title: Extremal problems for geometric hypergraphs
zbMATH Open document ID: 0902.05054
DOI: 10.1007/PL00009365
author: D. Massart
published in: Discrete \& Computational Geometry
publication date: 1998-06-11T00:00:00Z
review text: Bounds for the largest number of edges (\(i\)-simplices) in a geometric hypergraph with forbidden configurations such as intersecting edges, crossing edges, pairwise crossing edges, etc., are derived. Some of the bounds are tight.
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1164314
zbMATH Keywords: geometric hypergraph
zbMATH Keywords: crossing
zbMATH Keywords: bounds
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
full work available at URL: pl00009365
OpenAlex ID: W2024662946
description: scientific article; zbMATH DE number 1164314