A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
From MaRDI portal
Publication:2490871
DOI10.1016/j.jctb.2005.09.003zbMath1088.05014arXivmath/0506427OpenAlexW2148712149MaRDI QIDQ2490871
Publication date: 18 May 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0506427
Related Items (3)
The \(\varepsilon\)-\(t\)-net problem ⋮ Domination number of certain infinite tournaments ⋮ Condorcet winning sets
Cites Work
- Separating pairs of points of standard boxes
- Covering with Euclidean boxes
- Bounding the vertex cover number of a hypergraph
- Transversals of \(d\)-intervals
- Piercing \(d\)-intervals
- Voting paradoxes and digraphs realizations
- The Voting Problem
- The Paradox of Nontransitive Dice
- On a Problem in Graph Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)