✦ LIBER ✦

Clones containing all almost unary functions

✍ Scribed by Michael Pinsker

Book ID: 105754236
Publisher: Springer
Year: 2004
Tongue: English
Weight: 337 KB
Volume: 51
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s00012-004-1860-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Order function for almost all numbers

✍ Yu. V. Nesterenko 📂 Article 📅 1974 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 377 KB

Almost all boolean functions have no lin

Almost all boolean functions have no linear symmetries

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

On the Hamming distance between almost a

On the Hamming distance between almost all Boolean functions

✍ A. V. Galatenko; V. V. Galatenko 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 106 KB

Almost all cop-win graphs contain a univ

Almost all cop-win graphs contain a universal vertex

✍ Anthony Bonato; Graeme Kemkes; Paweł Prałat 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Almost All 3-Connected Graphs Contain a

Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 223 KB

McCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a connected subgraph H on k vertices such that G&V(H) is 2-connected. We prove the weaker statement that every sufficiently large 3-connected graph G contains a not necessarily connected subgraph H on k vertices s

The cardinality of the set of all clones

The cardinality of the set of all clones containing a given minimal clone on three elements

✍ Zhuk, Dmitriy N. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 417 KB