Lower bounds on the length of monotone paths in arrangements
type: Item
instance of: scholarly article
title: Lower bounds on the length of monotone paths in arrangements
zbMATH Open document ID: 1334.52016
DOI: 10.1007/BF02574679
published in: Discrete \& Computational Geometry
publication date: 2016-04-26T00:00:00Z
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 52C35
zbMATH DE Number: 6574172
Wikidata QID: Q56442909
author: Jiří Matoušek
MaRDI profile type: Publication
cites work: Q3772828
cites work: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
full work available at URL: https://doi.org/10.1007/bf02574679
OpenAlex ID: W2055418304
DBLP publication ID: journals/dcg/Matousek91
Recommended article: On some monotone path problems in line arrangements
Recommended article: On the Length of Monotone Paths in Polyhedra
Recommended article: Upper and Lower Bounds on Long Dual Paths in Line Arrangements
Recommended article: Erdős-Hajnal-type results for monotone paths
Recommended article: Lower bound on the size-Ramsey number of tight paths
Recommended article: Monotone paths in line arrangements with a small number of directions
Recommended article: Monotone paths in line arrangements
Recommended article: Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
Recommended article: Long monotone paths in line arrangements
description: scientific article; zbMATH DE number 6574172