✦ LIBER ✦

The algebra of set functions II: An enumerative analogue of Hall’s theorem for bipartite graphs

✍ Scribed by Bodo Lass

Book ID: 113582423
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 257 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.09.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Analogue for Algebraic Functions of t

An Analogue for Algebraic Functions of the Thue-Siegel Theorem

✍ Bennington P. Gill 📂 Article 📅 1930 🏛 John Hopkins University Press 🌐 English ⚖ 731 KB

On the analogue of Koebe's theorem for f

On the analogue of Koebe's theorem for functions with values in a Clifford algebra

✍ Richard Delanghe 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 294 KB

An Analogue of Hajós' Theorem for the Ci

An Analogue of Hajós' Theorem for the Circular Chromatic Number (II)

✍ Xuding Zhu 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 526 KB

An analogue of the Erdös-Ko-Rado theorem

An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms

✍ Tayuan Huang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 425 KB

An analogue of the Erd6s-Ko-Rado theorem is proved for the distance-regular graphs Hq(k, n) with k x n matrices over GF(q) as vertex set and two matrices A and B adjacent if the rank of A -B is 1, where n >~ k + 1 and (n, q) ~ (k + 1, 2). As an easy corollary, we prove that Hq(k, n) has no perfect e