𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A class of hypergraphs satisfying an inequality of Lovász

✍ Scribed by Zhang Cunquan; Li Weixuan

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
228 KB
Volume
34
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a class of balanced hypergraphs
On a class of balanced hypergraphs
✍ András Frank 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 986 KB

Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri

On a Conjecture of Lovász Concerning Bri
On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic
✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 271 KB

we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks and prove the theorem by applying induction to cut-contractions with respect to such cuts.

Covers in Uniform Intersecting Families
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász
✍ Peter Frankl; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu