𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The largest transversal numbers of uniform hypergraphs

✍ Scribed by Qingchuan Zhu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
492 KB
Volume
147
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

If H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal number of H has an upper bound in terms of the parameter c = p -2r. As corollaries of the main theorem, lower bounds for the largest order of r-uniform hypergraphs with specified transversal number and for the stability number of triangle-free graphs are given as well.

πŸ“œ SIMILAR VOLUMES

The chromatic numbers of random hypergra
The chromatic numbers of random hypergraphs
✍ Michael Krivelevich; Benny Sudakov πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 1 views

For a pair of integers 1 F β₯r, the β₯-chromatic number of an r-uniform Ε½ . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F β₯ for every e g E. In this paper we determine the asymptotic 1 k i Ε½ . behavior of the β₯-chromatic n

On the cyclomatic number of a hypergraph
On the cyclomatic number of a hypergraph
✍ B.D. Acharya πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an

Transversals of subtree hypergraphs and
Transversals of subtree hypergraphs and the source location problem in digraphs
✍ Jan van den Heuvel; Matthew Johnson πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

## Abstract A hypergraph __H__ = (__V__,__E__) is a subtree hypergraph if there is a tree __T__ on __V__ such that each hyperedge of __E__ induces a subtree of __T__. Since the number of edges of a subtree hypergraph can be exponential in __n__ = |__V__|, one can not always expect to be able to fin