Containment problems in high-dimensional spaces

DOI10.1007/BF01787813zbMath0843.05018MaRDI QIDQ1906857

Yoshiyasu Ishigami

Publication date: 24 January 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

lower boundclosed boxcontainment problem

Mathematics Subject Classification ID

Discrete geometry (52C99) Designs and configurations (05B99)

Related Items (7)

An extremal problem of orthants containing at most one point besides the origin ⋮ Sequence Covering Arrays and Linear Extensions ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ On the minimum number of completely 3-scrambling permutations ⋮ On 2min-sets and 2minmax-sets with respect to certain cycles ⋮ Perfect sequence covering arrays ⋮ The covering threshold of a directed acyclic graph by directed acyclic subgraphs

Cites Work

• Hypergraph families with bounded edge cover or transversal number
• Separating pairs of points of standard boxes
• Covering with Euclidean boxes
• A combinatorial result about points and balls in Euclidean space
• On a Ramsey-theoretic property of orders
• An extremal problem of orthants containing at most one point besides the origin
• On circles containing the maximum number of points
• Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Monotonic Subsequences

This page was built for publication: Containment problems in high-dimensional spaces