Saeed Shaebani

collaborators

4 papers

math.CO2026

On The Number of Irreducible FAT Colorings

Saeed Shaebani

A vertex coloring of a graph $G$ with nonempty color classes $V_{1}, V_{2}, \dots, V_{k}$ is called a \emph{FAT $k$ -coloring} if there exist real numbers $I^\pm, I^^{2} \in [0, 1]$ such that for every…

math.CO2025

Concerning FAT Colorings of Graphs

Saeed Shaebani

Let $G$ be a graph and let $C$ be a color set of cardinality $k$ . Suppose $c : V (G) \to C$ is a (not necessarily proper) vertex coloring whose all color classes are $V_{1}$ , $V_…

math.CO2025

On Fair and Tolerant Colorings of Graphs

Saeed Shaebani

A (not necessarily proper) vertex coloring of a graph $G$ with color classes $V_{1}$ , $V_{2}$ , $\dots$ , $V_{k}$ , is said to be a {\it Fair And Tolerant vertex coloring of $G$ with $k$ co…

math.CO2025

The Matching Ramsey Number of Hypergraphs, Revisited

Saeed Shaebani, Meysam Alishahi

Suppose that a hypergraph $H$ and an arbitrary nonempty (finite or infinite) set of available colors are given. Each color $x$ is associated with a frequency $I ¨ (x)$ , wh…