✦ LIBER ✦

A result concerning two conjectures of Berge and Chvátal

✍ Scribed by M. Gionfriddo; S. Milici

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 142 KB
Volume: 155
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00371-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On conjectures of Berge and Chvátal

✍ Mario Gionfriddo; Zsolt Tuza 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 533 KB

We investigate the relations among the chromatic index q(X), the maximum degree d(Z), the total chromatic number q\*(Z), and the maximum size d,(Z) of an intersecting subhypergraph of a hypergraph Z: For some particular classes of hypergraphs, including Steiner systems, we provide sufficient conditi

A new result on Chvátal's conjecture

✍ Hunter Snevily 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Pancyclic graphs and a conjecture of Bon

Pancyclic graphs and a conjecture of Bondy and Chvátal

✍ E.F Schmeichel; S.L Hakimi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Generalizations of a Ramsey-theoretic re

Generalizations of a Ramsey-theoretic result of chvátal

✍ Stefan A. Burr; Paul Erdös 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

## Abstract Chvátal has shown that if __T__ is a tree on __n__ points then __r__(__K~k~, T__) = (__k__ – 1) (__n__ – 1) + 1, where __r__ is the (generalized) Ramsey number. It is shown that the same result holds when __T__ is replaced by many other graphs. Such a __T__ is called __k__‐good. The res

The equivalence of two conjectures of Be

The equivalence of two conjectures of Berge and Fulkerson

✍ G. Mazzuoccolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 65 KB

Let G be a bridgeless cubic graph. Fulkerson conjectured that there exist six 1-factors of G such that each edge of G is contained in exactly two of them. Berge conjectured that the edge-set of G can be covered with at most five 1-factors. We prove that the two conjectures are equivalent.

Two conjectures of Demetrovics, Füredi,

Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions

✍ Bernhard Ganter; Hans-Dietrich O.F. Gronau 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 414 KB

It is possible to find II partitions of an n-element set whose pairwise intersections are just all atoms of the partition lattice? Demetrovics, Ftiredi and Katona verified this for all n -1 or 4 (mod 12) by constructing a series of special Mendelsohn Triple Systems. They conjectured that such tripl