Exact values and improved bounds on \(k\)-neighborly families of boxes
From MaRDI portal
Publication:6201906
DOI10.1016/j.ejc.2024.103926arXiv2301.06485OpenAlexW4391055591MaRDI QIDQ6201906
Meiqin Wang, Xinbu Cheng, Chi Hoi Yip, Zixiang Xu
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.06485
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- A new proof of a theorem of Graham and Pollak
- A counting proof of the Graham-Pollak theorem
- A polynomial space proof of the Graham-Pollak theorem
- On the decomposition ofkn into complete bipartite graphs
- Neighborly Families of Congruent Convex Polytopes
- A Stability Result for Families with Fixed Diameter
- On a combinatorial conjecture of Erdös
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
- Stability through non-shadows
This page was built for publication: Exact values and improved bounds on \(k\)-neighborly families of boxes
