k-optimal Partitions of a Directed Graph

@article{Berge1982koptimalPO,
  title={k-optimal Partitions of a Directed Graph},
  author={Claude Berge},
  journal={Eur. J. Comb.},
  year={1982},
  volume={3},
  pages={97-101}
}
A partition M is k-optimal if M minimizes BdM). For instance, if G has a Hamiltonian path J.Lo, then M = W.o} is a k -optimal partition. So the k -optimal partitions extend in some sense the concept of Hamiltonian paths. The theorem of Greene and Kleitman [10], which extends the Dilworth theorem [5], shows an important property of k-optimal partitions for the graph of a partially ordered set (in [1, 5], the k-optimal partitions are called "k-saturated"). This paper shows that similar properties… CONTINUE READING

From This Paper

Topics from this paper.

References

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

A decomposition theorem for partially ordered sets

  • R. P. Dilworth
  • Ann . of Math .
  • 1982

The structure of Sperner kfamilies

  • D. J. Kleitman
  • Theory Ser . A
  • 1976

Polyhedral and algorithmic ramifications of antichains

  • K. B. Cameron
  • Graph Theory with Applications,
  • 1972
1 Excerpt

Milgram , Verallgemeinerung eines Graphentheoretischen Satzes von Redei

  • N. A.
  • Acta Sci . Math .
  • 1968

Similar Papers

Loading similar papers…