A Gray code for the shelling types of the boundary of a hypercube
✍ Scribed by Sarah Birdsong; Gábor Hetyei
- Book ID
- 118271595
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 267 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We present two algorithms for listing all the ideals of a forest poset. These algorithms generate ideals in a gray code manner; that is, consecutive ideals differ by exactly one element. Both algorithms use storage \(O(n)\), where \(n\) is the number of elements in the poset. On each iteration, the
We prove that for every fixed k and ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Q n with k colors contains a monochromatic cycle of length 2 . This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which a
The generation of combinatorial objects in a Gray code manner means that the difference between successive objects is small, e.g., one element for subsets or one transposition for permutations of a set. The existence of such Gray codes is often equivalent to an appropriately defined graph on these o