𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partial Steiner systems and matchings in hypergraphs

✍ Scribed by A.V. Kostochka; V. Rödl

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
203 KB
Volume
13
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

For tk, a t, k T-system is a k-uniform hypergraph H such that any two Ž . distinct edges of H have at most t y 1 vertices in common. Clearly, any t, k -system on n n k

📜 SIMILAR VOLUMES

Perfect fractional matchings in random h
Perfect fractional matchings in random hypergraphs
✍ Michael Krivelevich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Given an r-uniform hypergraph H = (V, E ) on ( V ( = n vertices, a real-valued function f(e) 5 1 for all u E V and C e E E f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n + m , at the very moment to when the last isolated

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

Transversal hypergraphs to perfect match
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give an explicit characterization of the minimal blockers of a bipartite graph G. This result allows us to obtain a polynomial delay algorithm for finding all minimal blockers

New bounds on nearly perfect matchings i
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
✍ Van H. Vu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

Let H be a k + 1 -uniform, D-regular hypergraph on n vertices and let H be the minimum number of vertices left uncovered by a matching in H. C j H , the j-codegree of H, is the maximum number of edges sharing a set of j vertices in common. We prove a general upper bound on H , based on the codegree

Uniform two-class regular partial Steine
Uniform two-class regular partial Steiner triple systems
✍ Melissa S. Keranen; Donald L. Kreher; Sibel Özkan 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A 2‐class regular partial Steiner triple system is a partial Steiner triple system whose points can be partitioned into 2‐classes such that no triple is contained in either class and any two points belonging to the same class are contained in the same number of triples. It is uniform if