Covering with Euclidean boxes

DOI10.1016/S0195-6698(87)80001-XzbMath0623.05041MaRDI QIDQ1091402

Imre Bárány, Jenő Lehel

Publication date: 1987

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

zbMATH Keywords

stability numbercovering numberbox cover theorembox-hypergraphfinite-cone-subdivisions

Mathematics Subject Classification ID

Hypergraphs (05C65) Polyhedra and polytopes; regular figures, division of spaces (51M20) Other problems of combinatorial convexity (52A37)

Related Items (11)

Tverberg's theorem, disks, and Hamiltonian cycles ⋮ Containment problems in high-dimensional spaces ⋮ Supervised box clustering ⋮ Domination in transitive colorings of tournaments ⋮ Intersecting diametral balls induced by a geometric graph ⋮ On a Ramsey-theoretic property of orders ⋮ Positive-fraction intersection results and variations of weak epsilon-nets ⋮ On 2min-sets and 2minmax-sets with respect to certain cycles ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ Extended box clustering for classification problems ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph families with bounded edge cover or transversal number
• On monochromatic paths in edge-coloured digraphs
• The computation of fixed points and applications
• Monochromatic paths in edge-colored graphs
• A Ramsey-type problem in directed and bipartite graphs
• Sous Les Pavés…

This page was built for publication: Covering with Euclidean boxes