Separating pairs of points of standard boxes

DOI10.1016/S0195-6698(85)80028-7zbMath0592.05002OpenAlexW2092016526MaRDI QIDQ1075327

Noga Alon, Meir Katchalski, Zoltan Fueredi

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80028-7

zbMATH Keywords

distinct pointsseparated 2-sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (05C99)

Related Items (10)

An extremal problem of orthants containing at most one point besides the origin ⋮ Containment problems in high-dimensional spaces ⋮ An extension of the Erdős-Szekeres theorem on large angles ⋮ Supervised box clustering ⋮ 4-labelings and grid embeddings of plane quadrangulations ⋮ Orthogonal surfaces and their CP-orders ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ Witness rectangle graphs ⋮ On the shortest separating cycle ⋮ Lower and upper bounds for \(\omega\)-limit sets of nonexpansive maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sous Les Pavés…
• Nombre chromatique et plus longs chemins d'un graphe
• Monotonic Subsequences
• On the structure of linear graphs

This page was built for publication: Separating pairs of points of standard boxes