相关论文: Locally Semi-Equitable Colourings of BIBDs

A weak $c$-colouring of a balanced incomplete block design (BIBD) is a colouring of the points of the design with $c$ colours in such a way that no block of the design has all of its vertices receive the same colour. A BIBD is said to be…

An $\ell$-cycle decomposition of $K_v$ is said to be \emph{equitably $2$-colourable} if there is a $2$-vertex-colouring of $K_v$ such that each colour is represented (approximately) an equal number of times on each cycle: more precisely, we…

In these notes we investigate BIBDs with $\lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to…

We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…

Balanced incomplete block designs (BIBDs) are a class of designs with v treatments and b blocks of size k that are optimal with regards to a wide range of optimality criteria, but it is not clear which designs to choose for combinations of…

Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…

A $(v,k,\lambda)$-BIBD $(X,\mathcal B)$ can be nested if there is a mapping $\phi:\mathcal B\rightarrow X$ such that $(X,\{B\cup\{\phi(B)\}\mid B\in\mathcal B\})$ is a $(v,k+1,\lambda+1)$-packing. A $(v,k,\lambda)$-BIBD has a (perfect)…

In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We…

Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

The $k$-colouring reconfiguration problem asks whether, for a given graph $G$, two proper $k$-colourings $\alpha$ and $\beta$ of $G$, and a positive integer $\ell$, there exists a sequence of at most $\ell+1$ proper $k$-colourings of $G$…

We examine electrically and color neutral quark matter in beta-equilibrium focusing on the possibility of mixed phases between different color superconducting phases. To that end we apply the Gibbs criterion to ensure phase equilibrium and…

A weak $c$-colouring of a design is an assignment of colours to its points from a set of $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block-equitable, if for each block, the number of points…

In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…

If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…

A coloring of the $\ell$-dimensional faces of $Q_n$ is called $d$-polychromatic if every embedded $Q_d$ has every color on at least one face. Denote by $p^\ell(d)$ the maximum number of colors such that any $Q_n$ can be colored in this way.…

Let $\Sigma=(X,\mathcal B)$ a $4$-cycle system of order $v=1+8k$. A $c$-colouring of type $s$ is a map $\phi\colon \mathcal B\rightarrow \mathcal C$, with $C$ set of colours, such that exactly $c$ colours are used and for every vertex $x$…

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

Let $n \ge d \ge \ell \ge 1$ be integers, and denote the $n$-dimensional hypercube by $Q_n$. A coloring of the $\ell$-dimensional subcubes $Q_\ell$ in $Q_n$ is called a $Q_\ell$-coloring. Such a coloring is $d$-polychromatic if every $Q_d$…