Abstract
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s Theorem. This suggests that the Greene-Kleitman Theorem is stronger than Greene’s Theorem on posets. We leave it as an open question whether the same holds for all digraphs, that is, does Berge’s conjecture concerning path partitions in digraphs imply the extension of Greene’s theorem to all digraphs (conjectured by Aharoni, Hartman and Hoffman)?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharoni, R., Ben-Arroyo Hartman, I., Hoffman, A.J.: Path partitions and packs of acyclic digraphs. Pacific Journal of Mathematics 118(2), 249–259 (1985)
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)
Berge, C.: k-optimal partitions of a directed graph. Europ. J. Combinatorics 3, 97–101 (1982)
Berger, E., Hartman, I.B.-A.: Proof of Berge’s Strong Path Partition Conjecture for k = 2. Europ. J. Combinatorics 29(1), 179–192 (2008)
Cameron, K.: On k-optimum dipath partitions and partial k-colourings of acyclic digraphs. Europ. J. Combinatorics 7, 115–118 (1986)
Cameron, K.: Gallai-type min-max inequalities. In: Proceedings of the Third China-USA International Conference on Graph Theory, Combinatorics, Computing and Applications, pp. 7–16. World Scientific, Singapore (1994)
Dilworth, P.: A decomposition theorem for partially ordered sets. Ann. of Math. 51(1), 161–166 (1950)
Mercier, F.: Personal communication
Frank, A.: On chain and antichain families of a partially ordered set. J. Comb. Theory, Ser. B 29, 176–184 (1980)
Gallai, T.: On directed paths and circuits. In: Erdos, P., Katona, G. (eds.) Theory of Graphs, pp. 115–118. Academic Press, New York (1968)
Gallai, T., Milgram, A.N.: Verallgemeinerung eines graphentheoretischen satzes von Redei. Acta Sc. Math. 21, 181–186 (1960)
Greene, C.: Some partitions associated with a partially ordered set. J. Combinatorial Theory, Ser. A 20, 69–79 (1976)
Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Combinatorial Theory, Ser. A 20, 41–68 (1976)
Hartman, I.B.-A.: Berge’s conjecture on directed path partitions - a survey. Discrete Math. 306, 2498–2514 (2006)
Linial, N.: Extending the Greene-Kleitman theorem to directed graphs. J. Combinatorial Theory, Ser. A 30, 331–334 (1981)
Roy, B.: Nombre chromatique et plus longs chemins, Rev. F1. Automat. Informat. 1, 127–132 (1976)
Saks, M.: A short proof of the k-saturated partitions. Adv. In Math. 33, 207–211 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ben-Arroyo Hartman, I. (2009). On Path Partitions and Colourings in Digraphs. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds) Graph Theory, Computational Intelligence and Thought. Lecture Notes in Computer Science, vol 5420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02029-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02029-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02028-5
Online ISBN: 978-3-642-02029-2
eBook Packages: Computer ScienceComputer Science (R0)