✦ LIBER ✦

On the equivalence covering number of splitgraphs

✍ Scribed by A. Blokhuis; T. Kloks

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 338 KB
Volume: 54
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00037-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Covering Number of the GroupPSLn(F)

✍ Arieh Lev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let G be the group PSL F , where n G 3, F is a field, and F G 4. Assume, n further, that if n s 3, then F is either finite or algebraically closed. Given an k Ä 4 integer k and a subset A : G, denote A s a a иии a ¬ a , a , . . . , a g A . 1 2 k 1 2 k Ž . k Denote by cn G the minimal value of k such

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

On the maximal number of non-C-endorigid

On the maximal number of non-C-endorigid equivalence relations

✍ Ivo Düntsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Bounds for the covering number of a grap

Bounds for the covering number of a graph

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 333 KB

On the number of blocks in a perfect cov

On the number of blocks in a perfect covering of υ points

✍ Rolf Rees; D.R. Stinson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 710 KB

In this paper, we study bounds on gck'(v), which denotes the minimum number of blocks to cover every pair of a v-set exactly once, when the largest block has size k. This bound is exact when v < 2k, but becomes progressively weaker as u increases (for any fixed value of k). A much more powerful bou

The covering number and the uniformity o

The covering number and the uniformity of the ideal ℐf

✍ Noboru Osuga 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract Let __f, g__ ∈ ^__ω__^ __ω__ . We will denote by __g__ ≫ __f__ that for every __k__ < __ω__, __f__ (__n__ ^__k__^ ) ≤ __g__ (__n__ ) except for finitely many __n__ . The ideal ℐ~__f__~ on ^__ω__^ 2 is the collection of sets __X__ such that, for some __g__ ≫ __f__ and __τ__ ∈ ∏~__n__ <_