Extremal Problems for Geometric Hypergraphs

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Conference object 01 Jan 1996 Switzerland English Publisher:Springer Science and Business Media LLCJournal:Discrete & Computational Geometry, volume 19, pages 473-484 (issn: 0179-5376,

Copyright policy )

Authors: Dey, T. K.; Pach, János;

doi: 10.1007/pl00009365 , 10.1007/bfb0009486

handle: 20.500.14299/31093

Extremal Problems for Geometric Hypergraphs

- Summary
- Subjects
- Metrics

Abstract

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.

Country

Switzerland

Related Organizations

École Polytechnique Fédérale de Lausanne EPFL
Switzerland
Indian Institute of Technology BHU
India
Hungarian Academy of Sciences
Hungary
Courant Institute of Mathematical Sciences
United States
New York University
United States

View all View all

Keywords

geometric hypergraph, Extremal problems in graph theory, crossing bounds, crossing, bounds, Hypergraphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	25
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average