Related papers: Stanley--Elder--Fine theorems for colored partitio…

Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…

By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…

Andrews and Keith recently produced a general Schmidt type partition theorem using a novel interpretation of Stockhofe's bijection, which they used to find new $q$-series identities. This includes an identity for a trivariate 2-colored…

Recently, Andrews proved two conjectures on a partition statistic introduced by Beck. Very recently, Chern established some results on weighted rank and crank moments and proved many Andrews-Beck type congruences. Motivated by Andrews and…

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…

In this paper, we combined two types of partitions and introduced 2-colored Rogers-Ramanujan partitions. By finding some functional equations and using a constructive method, some identities have been found. Some Overpartition identities…

Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, Seymour, van der Zypen and Wood states that every directed…

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…

In 2016 Bessenrodt--Ono discovered an inequality addressing additive and multiplicative properties of the partition function. Generalization by several authors have been given; on partitions with rank in a given residue class by…

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…