Partitions of bi-partite numbers into at most j parts

Bruce M. Landman, Ezra A. Brown, Frederick J. Portier

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

The number of partitions of a bi-partite number into at most j parts is studied. We consider this function, pj(x, y), on the line x+y=2n. For j≤4, we show that this function is maximized when x=y. For j>4 we provide an explicit formula for nj so that, for all n≥nj, x=y yields a maximum for pj(x,y).

Original languageEnglish (US)
Pages (from-to)65-73
Number of pages9
JournalGraphs and Combinatorics
Volume8
Issue number1
DOIs
Publication statusPublished - Mar 1 1992
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this