𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2-Matchings and 2-covers of hypergraphs

✍ Scribed by L. Lovász

Publisher
Akadmiai Kiad
Year
1975
Tongue
English
Weight
754 KB
Volume
26
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in hypergraphs of large minimu
Matchings in hypergraphs of large minimum degree
✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract It is well known that every bipartite graph with vertex classes of size __n__ whose minimum degree is at least __n__/2 contains a perfect matching. We prove an analog of this result for hypergraphs. We also prove several related results that guarantee the existence of almost perfect mat

Capacities of graphs and 2-matchings
Capacities of graphs and 2-matchings
✍ G. Greco 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 385 KB

A graph G is symmetric with respect to a functional Fc(P) defined on the set of all the probability distributions on its vertex set if the distribution P\* maximizing Fa(P) is uniform on V(G). We show that the class of graphs which are symmetric for the functional appearing in the capacity formula o

Chromatic numbers of hypergraphs and cov
Chromatic numbers of hypergraphs and coverings of graphs
✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization