✦ LIBER ✦

On the Chromatic Index of a Linear Hypergraph and the Chvátal Conjecture

✍ Scribed by C. BERGE

Book ID: 119862994
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 239 KB
Volume: 555
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb22435.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of hypergraphs that a

A characterization of hypergraphs that achieve equality in the Chvátal–McDiarmid Theorem

✍ Henning, Michael A.; Löwenstein, Christian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 391 KB

On a problem of Chvátal and Erdös on hyp

On a problem of Chvátal and Erdös on hypergraphs containing no generalized simplex

✍ Peter Frankl 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 494 KB

On the Chvátal rank of linear relaxation

On the Chvátal rank of linear relaxations of the stable set polytope

✍ Eugenia Holm; Luis M. Torres; Annegret K. Wagler 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

A lower bound on the Chvátal-rank of Ant

A lower bound on the Chvátal-rank of Antiwebs

✍ Eugenia Holm; Luis M. Torres; Annegret K. Wagler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 177 KB

On the Degree, Size, and Chromatic Index

On the Degree, Size, and Chromatic Index of a Uniform Hypergraph

✍ Noga Alon; Jeong Han Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every =>0, if D is sufficiently large as a function of t, k, and =, then the chromatic index of H is at most (t&1+1Ât+=) D. We prove t

A generalization of the Bondy-Chvátal th

A generalization of the Bondy-Chvátal theorem on the k-closure

✍ Zhu Yong-jin; Tian Feng 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 368 KB