Title
Embeddability of the combinohedron
Abstract
Let e1,…,em be m different symbols, let r1⩾⋯⩾rm be positive integers, and let n=∑i=1mri. The combinohedron, denoted by C(r1,…,rm), is the loopless graph whose vertices are the n-tuples in which the symbol ei appears exactly ri times, and where an edge joins two vertices if and only if one can be transformed into the other by interchanging two adjacent entries. The graph known as permutohedron is a particular case of the combinohedron. Here, we extend to the combinohedron some results on embeddability of the permutohedron.
Year
DOI
Venue
2002
10.1016/S0012-365X(01)00298-9
Discrete Mathematics
Keywords
Field
DocType
05C10,05C45,52C07
Integer,Discrete mathematics,Joins,Combinatorics,Embedding,Vertex (geometry),Tuple,Multinomial distribution,Permutohedron,If and only if,Mathematics
Journal
Volume
Issue
ISSN
254
1
0012-365X
Citations 
PageRank 
References 
2
0.48
1
Authors
2
Name
Order
Citations
PageRank
J.L. Ramı́rez Alfonsı́n130.83
David Romero2223.65