✦ LIBER ✦

An upper bound for the transversal numbers of 4-uniform hypergraphs

✍ Scribed by Feng-Chu Lai; Gerard J Chang

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 214 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90101-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The largest transversal numbers of unifo

The largest transversal numbers of uniform hypergraphs

✍ Qingchuan Zhu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 492 KB

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 s

An upper bound for the ramsey number M(5

An upper bound for the ramsey number M(5, 4)

✍ K Walker 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 498 KB

An Upper Bound for the Independent Domin

An Upper Bound for the Independent Domination Number

✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

An upper bound for the average number of

An upper bound for the average number of regions

✍ Saul Stahl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 190 KB

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the Ramsey numbers r(

An upper bound for the Ramsey numbers r(K3,G)

✍ Wayne Goddard; Daniel J. Kleitman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 372 KB

The Ramsey number r(H, G) is defined as the minimum N such that for any coloring of the edges of the N-vertex complete graph KN in red and blue, it must contain either a ted H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K,, G)< 2qf 1 where G has q edges. In o