Lower bounds on the length of monotone paths in arrangements

DOI10.1007/BF02574679zbMATH Open1334.52016DBLPjournals/dcg/Matousek91OpenAlexW2055418304WikidataQ56442909 ScholiaQ56442909MaRDI QIDQ276089FDOQ276089

Authors: Jiří Matoušek 

Publication date: 26 April 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02574679

Recommendations

• On some monotone path problems in line arrangements
• On the length of monotone paths in polyhedra
• Upper and lower bounds on long dual paths in line arrangements
• Erdős-Hajnal-type results for monotone paths
• Lower bound on the size-Ramsey number of tight paths
• Monotone paths in line arrangements with a small number of directions
• Monotone paths in line arrangements
• Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
• Long monotone paths in line arrangements
• Long monotone paths in line arrangements

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cites Work

• Title not available (Why is that?)
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)

Cited In (8)

• Long monotone paths in line arrangements
• Long monotone paths in line arrangements
• Upper and lower bounds on long dual paths in line arrangements
• Monotone paths in line arrangements
• On some monotone path problems in line arrangements
• Monotone paths in line arrangements with a small number of directions
• On disjoint concave chains in arrangements of (pseudo) lines
• A pseudo-algorithmic separation of lines from pseudo-lines

This page was built for publication: Lower bounds on the length of monotone paths in arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276089)