✦ LIBER ✦

Almost all digraphs have a kernel

✍ Scribed by Ioan Tomescu

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 561 KB
Volume: 84
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90373-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost all quasigroups have rank 2

✍ Peter J. Cameron 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Almost all steinhaus graphs have diamete

Almost all steinhaus graphs have diameter 2

✍ Neal Brand 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract A Steinhaus graph is a graph with __n__ vertices whose adjacency matrix (__a__~i, j~) satisfies the condition that __a__~i, j~  __a__~a‐‐1, j‐‐1~ + __a__ ~i‐‐1, j~ (mod 2) for each 1 < __i__ < __j__ ≤ __n__. It is clear that a Steinhaus graph is determined by its first row. In [3] Brin

Almost all boolean functions have no lin

Almost all boolean functions have no linear symmetries

✍ Michael Clausen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 146 KB

About quasi-kernels in a digraph

✍ H. Jacob; H. Meyniel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We generalize a result by Maghout who had shown that every tournament of radius 2 admits three distinct centers. Here we prove that every graph without kernel has at least three distinct quasi-kernels.

Almost all trees have tribe number 2 or

Almost all trees have tribe number 2 or 3

✍ J. Komlós; W.O.J. Moser 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Let T be a tree on n vertices, and let E <$ be a small fixed positive number. The tribe number t&) of T is the smallest integer r such that when any vertex is deleted, some r or fewer subtrees in the resulting forest together contain more than (1-e)n vertices. We prove the following, theorem: Almost

Almost all one-rule thue systems have de

Almost all one-rule thue systems have decidable word problems

✍ Ronald V Book; Craig C Squier 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 167 KB

The decidability of the word problem for one-rule Thue systems is an open cluestion. In the case of one-rule special Thue systems, i.e., those of the form {(w, 1)} where 1 is the identity, it is known [1] that the word problem is decidable. Here we show that 'almost all' one-rule Thue systems have