On the existence of Hamiltonian paths in the cover graph of M(n)

@article{Savage2003OnTE,
  title={On the existence of Hamiltonian paths in the cover graph of M(n)},
  author={Carla D. Savage and Ian Shields and Douglas B. West},
  journal={Discrete Mathematics},
  year={2003},
  volume={262},
  pages={241-252}
}
The poset M(n) has as its elements the n-tuples of integers a = (a1, a2, . . . , an) satisfying 0 = a1 = · · · = aj < aj+1 < · · · an ≤ n for some j, 0 ≤ j ≤ n. The order relation is defined by a ≤ b iff ai ≤ bi for 1 ≤ i ≤ n. We show that the cover graph of M(n) has a Hamiltonian path if and only if ( n+1 2 ) is odd and n 6= 5. 

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Weyl groups

  • R. P. Stanley
  • the hard Lefschetz theorem, and the Sperner…
  • 1980
Highly Influential
4 Excerpts

Gray codes with optimized run lengths

  • L. Goddyn, G. M. Lawrence, E. Nemeth
  • Utilitas Mathematica, 34
  • 1988

Constructive combinatorics

  • D. Stanton, D. White
  • Undergraduate Texts in Mathematics, Springer…
  • 1986
1 Excerpt

Solution of two di cult combinatorial problems with linear algebra

  • R. A. Proctor
  • Amer. Math. Monthly 89
  • 1982
2 Excerpts

Lexicographic matching in Boolean algebras

  • M. Aigner
  • J. Combinatorial Theory Ser. B 14
  • 1973

Gray Codes and paths on the n-cube

  • E. N. Gilbert
  • Bell System Technical Journal, Vol. 37
  • 1958

Pulse code communication

  • F. Gray
  • U.S Patent No. 2632058
  • 1953

Similar Papers

Loading similar papers…