New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)

DOI10.1016/j.ejc.2023.103797zbMath1522.05196arXiv2212.05133MaRDI QIDQ6056562

Krzysztof Przeslawski, Andrzej P. Kisielewicz, Jarosław Grytczuk, Noga Alon

Publication date: 2 October 2023

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

Full work available at URL: https://arxiv.org/abs/2212.05133

zbMATH Keywords

axis-aligned boxesmaximum size of sets with a given diameter in discrete hypercubes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Enumeration in graph theory (05C30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Exact values and improved bounds on \(k\)-neighborly families of boxes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• Polyboxes, cube tilings and rigidity
• Variations on a theme of Graham and Pollak
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös

This page was built for publication: New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)