Motivations and history of some of my conjectures

DOI10.1016/S0012-365X(96)00161-6zbMath0873.05066WikidataQ123224755 ScholiaQ123224755MaRDI QIDQ1356729

Claude Berge

Publication date: 26 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphsperfect graph conjecturepath-partition conjecturesVizing type conjectures

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Development of contemporary mathematics (01A65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Chordal editing is fixed-parameter tractable, A limit theorem for the Shannon capacities of odd cycles. II, Shannon capacity and the categorical product, A combinatorial approach to nonlocality and contextuality, On minimal forbidden subgraph characterizations of balanced graphs, Independence polynomials of circulants with an application to music

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Path partitions and packs of acyclic digraphs
• The chromatic index of simple hypergraphs
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• A short proof of the existence of k-saturated partitions of partially ordered sets
• Extending the Greene-Kleitman theorem to directed graphs
• The chromatic index of cyclic Steiner 2-designs
• k-optimal partitions of a directed graph
• Chvatal's conjecture and point-intersections
• On the Berge's strong path partition conjecture
• Some results about the Chvatal conjecture
• On the perfect graph conjecture
• On conjectures of Berge and Chvátal
• Extending Greene's theorem to directed graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Path Partitions in Directed Graphs
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
• On the Shannon capacity of a graph
• On greene's theorem for digraphs
• Nombre chromatique et plus longs chemins d'un graphe
• On chromatic number of finite set-systems
• The structure of Sperner k-families