Motivations and history of some of my conjectures

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 61-70

  Berge, Claude ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17744417388     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00161-6     Document Type: Article

References (57)

1. R. Aharoni, I. Ben-Arroyo Hartman and A.J. Hoffman, Path-partitions and packs of acyclic digraphs, Pacific J. Math. 118 (1985) 249-259.
2. I. Ben-Arroyo Hartman, F. Sale and D. Hershkowitz, On Greene's Theorem for digraphs, J. Graph Theory 18 (1994) 169-175.
3. C. Berge, Les problèmes de coloration en Théorie des Graphes, Publ. Inst. Statist. Univ. Paris 9 (1960) 123-160.
4. C. Berge, Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammen-fassung), Wiss. Zeit, der Martin-Luther Universitat Halle-Wittenberg, Math. Natur. Reihe 10 (1961) 114.
5. C. Berge, Sur une conjecture relative au problème des codes optimaux (mimeo.), Proc. Internat. Conf. on Coding Theory, 14th General Meeting of the Internat. Institutes of Radio Science (U.R.S.I.), Tokyo, 1963; a printed version appears as: C. Berge, Some classes of perfect graphs, in: Six papers on Graph Theory, Indian Statistical Institute (Mc Millan, Calcutta, 1963) 1-21.
6. C. Berge, Sur une conjecture relative au problème des codes optimaux (mimeo.), Proc. Internat. Conf. on Coding Theory, 14th General Meeting of the Internat. Institutes of Radio Science (U.R.S.I.), Tokyo, 1963; a printed version appears as: C. Berge, Some classes of perfect graphs, in: Six papers on Graph Theory, Indian Statistical Institute (Mc Millan, Calcutta, 1963) 1-21.
7. C. Berge, Une Application de la Théorie des Graphes à un problème de Codage, in: E.R. Caianiello, ed., Automata Theory (Academic Press, New York, 1966) 25-34.
8. C. Berge, Some classes of perfect graphs, in: F. Harary, ed., Graph Theory and Theoretical Physics (Academic Press, New York, 1967) 155-165.
9. C. Berge, Some classes of perfect graphs, in: Combinatorial Mathematics and its Applications Proc. Conf. Univ. North Carolina, Chapel Hill, 1967 (Univ. North Caolina Press, 1969) 539-552.
10. C. Berge, The rank of a family of sets and some applications to graph theory, in: Recent Progress in Combinatorics, Proc. 3rd Waterloo Conf. on Combinatorics, 1968 (Academic Press, New York, 1969) 49-57.
11. C. Berge, A theorem related to the Chvátal Conjecture, in: C. Nash-Williams and J. Sheehan, eds., Proc. 5th British Combinatorial Conf. (Utilitas Math., Winnipeg, 1976) 35-40.
12. C. Berge, k-optimal partitions of a directed graph, European J. Combin. 3 (1982) 97-101.
13. C. Berge, Path-partitions in directed graphs, in: Berge, Bresson, Camion, Maurras and Sterboul, eds., Combinatorial Mathematics (North-Holland, Amsterdam, 1983) 32-44.
14. C. Berge, A property of k-optimal path-partitions, in: Bondy and Murty, eds., Progress in Graph Theory (Academic Press, New York, 1984) 105-108.
15. C. Berge, On the chromatic index of a linear hypergraph and the Chvátal conjecture in: G.S. Bloom, R.L. Graham and J. Malkevitch, eds., Annals of the New York Academy of Sciences, vol. 555, New York (1989) 40-44; proc., June 1985.
16. C. Berge, Hypergraphs, Combinatorics of Finite Sets (North-Holland, New York, 1989) Ch. 1, Section 4.
17. C. Berge, On two conjectures to generalize Vizing's Theorem, Le Matematiche 45 (1990) 15-24.
18. C. Berge, The q-perfect graphs I: The case q = 2, in: Lovász, Miklós, Szönyi, eds., Sets, Graphs and Numbers, Colloq. Math. Soc. Janós Bolyai, vol. 60 (1992) 67-76.
19. C. Berge, The q-perfect graphs II, in: Y. Alavi, A. Schwenk eds., Graph Theory, Combinatorics and Applications (Wiley Interscience, New York, 1995) 47-62.
20. C. Berge and V. Chvátal (eds.), Topics on Perfect Graphs, Annals of Discrete Mathematics, vol. 21 (North Holland, Amsterdam, 1984).
21. C. Berge and A.J.W. Hilton, On two conjectures about edge colouring for hypergraphs, Congr. Numer. 70 (1990) 99-104.
22. K. Cameron, On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, European, J. Combin. 7 (1986) 115-118.
23. W.I. Chang and E. Lawler, Edge coloring of hypergraphs and a conjecture of Erdo″s-Faber-Lovász, Combinatorica 8 (1988) 293-295.
24. V. Chvátal, Intersecting families of edges in hypergraphs having the hereditary property, in: Berge and Ray-Chaudhuri, eds., Hypergraph Seminar, Lecture Notes in Mathematics, vol. 411 (Springer, Berlin, 1974) 61-66.
25. J. Colbourn and M. Colbourn, The chromatic index of cyclic Steiner 2-design, Internat. J. Math. Sci. 5 (1982) 823-825.
26. P. Erdo″s, Problems and results in Graph Theory, Utilitas Math. 15.
27. P. Erdo″s, V. Faber and L. Lovász, Open Problem, in: Berge and Ray Chaudhuri, eds., Hypergraph Seminar, Lecture Notes in Mathematics, vol. 411 (Springer, Berlin, 1974).
28. D.R. Fulkerson (ed.), Studies in Graph Theory, Studies in Mathematics, vol. 12 (The Mathematical Association of America, Providence, RI, 1975).
29. Z. Füredi, The Chromatic index of simple hypergraphs, Res. Problem, Graphs Combin. 2 (1986) 89-92.
30. T. Gallai, Graphen mit triangulierbaren ungeraden Vielecken, Magyar Tud. Akad. Mat. Kutato Int. Közl. 7 (1962) 3-36.
31. T. Gallai, On directed paths and circuits, in: Erdo″s and Katona, eds., Theory of Graphs (Academic Press, New York, 1968) 115-118.
32. T. Gallai and A.N. Milgram, Verallgemeinerung eines Graphentheoretischen Satzes von Rédei, Acta Sci. Math. 21 (1960) 181-186.
33. A. Ghouila-Houri, Sur une conjecture de Berge (mimeo.), Institut Henri Poincaré, 1960.
34. M. Gionfriddo and Zs. Tuza, On conjectures of Berge and Chvátal, Discrete Math. 124 (1994) 76-86.
35. C. Greene and D.J. Kleitman, The structure of Sperner k-families, J. Combin. Theory Ser. A 34 (1976) 41-68.
36. A. Hajnal and J. Surányi, Ueber die Auflösung von Graphen in vollstándige Teilgraphen, Ann. Univ. Budapest Rolando Eötvös 1 (1958) 53-57.
37. N. Hindman, On a conjecture of Erdo″s, Farber, Lovász about n-colorings, Canad. J. Math. 33 (1981) 563-570.
38. A.J. Hoffman, Extending Greene's Theorem to directed graphs, J. Combin Theory Ser. A 34 (1983) 102-107.
39. P. Horák, A coloring problem related to the Erdo″s-Faber-Lovasz Conjecture, J. Combin. Theory Ser. B 50 (1990) 321-322.
40. N. Linial, Extending the Greene-Kleitman theorem to directed graphs, J. Combin. Theory Ser. A 30 (1981) 331-334.
41. L. Lovász, On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hungar. 19 (1968) 59-67.
42. L. Lovász, Normal hypergraphs and the Perfect Graph Conjecture, Discrete Math. 2 (1972) 253-267.
43. L. Lovász, A characterization of perfect graphs, J. Combin. Theory Ser. B 13 (1972) 95-98.
44. L. Lovász, On the Shannon capacity of a noisy channel, I.R.E. Trans. Inform. Theory IT-25 (1979) 1-7.
45. S.E. Markosian and I.A. Karpetian, On perfect graphs, Akad. Nauk Armjan. S.S.R. Dokl. 63 (1976) 292-296 (in Russian).
46. H. Meyniel, On the perfect graph conjecture, Discrete Math. 16 (1976) 339-342.
47. H. Meyniel, private communication, 1985 (or 1986?).
48. C. Payan, private communication, 1981.
49. B. Roy, Nombre chromatique et plus longs chemins, Rev. Fr. Automat. Inform. 1 (1967) 127-132.
50. H. Sachs, On the Berge Conjecture concerning perfect graphs, Combinatorial Structures and their Applications, Proc. Calgary Internat. Conf. Calgary, 1969 (Gordon and Breach, London, 1970) 377-384.
51. M. Saks, A short proof of the the k-saturated partitions, Adv. in Math. 33 (1979) 207-211.
52. C.E. Shannon, The zero-error capacity of a noisy channel, I.R.E. Trans. Inform. Theory IT-2 (1956) 8-19.
53. S. Sridharan, On the Berge's strong path-partition conjecture, Discrete Math. 112 (1993) 289-293.
54. P. Stein, Chvátal's conjecture and point intersections, Discrete Math. 43 (1983) 321-323.
55. F. Sterboul, Sur une conjecture de V. Chvátal, in: Berge and Ray-Chaudhuri, eds., Hypergraph Seminar, Lecture Notes in Mathematics, vol. 411 (Springer, Berlin, 1974) 152-164.
56. L. Surányi, The covering of graphs by cliques, Studia Sci. Math. Hungar. 3 (1968) 345-349.
57. D.L. Wang and P. Wang, Some results about the Chvátal conjecture, Discrete Math. 24 (1978) 95-101.