✦ LIBER ✦

A Note on Graphical Partitions

✍ Scribed by C.C. Rousseau; F. Ali

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 165 KB
Volume: 64
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1038

No coin nor oath required. For personal study only.

✦ Synopsis

We give a simple proof that the number of graphical partitions of an even positive integer (n) is at least (p(n)-p(n-1) . \quad 1995) Academic Press. Inc.

📜 SIMILAR VOLUMES

A note on complete partitions in boolean

A note on complete partitions in boolean algebras

✍ Wojciech Sachwanowicz 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

A Note on Layer Replacements and Solid P

A Note on Layer Replacements and Solid Partitions

✍ E.E. Guerin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 161 KB

A layer replacement method is used to obtain combinatorial interpretations of solid partitions with ' \(f(a)\) copies of \(a\) ' for some arithmetic functions \(f\).

A note on simple graphic algebras

✍ Juhani Nieminen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

A NOTE ON SIMPLE GRAPHIC ALGEBRAS by JUHANT NIEMTNEN in Helsinki (Finland) 111 troduction Several authors have studied the structure of algebras with a ternary operation called median operation, scc e.g. [I], [2], [3], [4], and [7]. Most of the authors have concentrated on the lattice and tree struc

A Note on Graphical Representation of Ri

A Note on Graphical Representation of Rings

✍ P.K. Sharma; S.M. Bhatwadekar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

A Note on Boolean Algebras with Few Part

A Note on Boolean Algebras with Few Partitions Modulo some Filter

✍ Markus Huberich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

We show that for every uncountable regular K and every K-complete Boolean algebra B of density 5 K there is a filter F B such that the number of partitions of length < K modulo F is 5 2'". We apply this to Boolean algebras of the form P ( X ) / I , where I is a n-complete K-dense ideal on X .