Related papers: A note on measure-theoretic domatic partitions

Let $c_1, c_2, \cdots, c_k$ be $k$ non-negative integers. A graph $G$ is $(c_1, c_2, \cdots, c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, \ldots, V_k$, such that the subgraph $G[V_i]$, induced by $V_i$, has…

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

Borel probability measures living on metric spaces are fundamental mathematical objects. There are several meaningful distance functions that make the collection of the probability measures living on a certain space a metric space. We are…

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph associated to the equivalence relation $\mathbb{E}_0$ on the…

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…

The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…

In this short paper, we introduce a new vertex coloring whose motivation comes from our series on odd edge-colorings of graphs. A proper vertex coloring $\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$…

A graph is $\ell$-choosable if, for any choice of lists of $\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs…

A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v,…

A graph is $(k_1,k_2)$-colorable if its vertex set can be partitioned into a graph with maximum degree at most $k_1$ and and a graph with maximum degree at most $k_2$. We show that every $(C_3,C_4,C_6)$-free planar graph is…

We prove that if $X$ is a real rearrangement-invariant function space on $[0,1]$, which is not isometrically isomorphic to $L_2,$ then every surjective isometry $T:X\to X$ is of the form $Tf(s)=a(s)f(\sigma(s))$ for a Borel function $a$ and…

Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…

It is shown that given a metric space $X$ and a $\sigma$-finite positive regular Borel measure $\mu$ on $X$, there exists a bounded continuous real-valued function on $X$ that is one-to-one on the complement of a set of $\mu$ measure zero.

Let $(X,T)$ be a topological dynamical system. We define the measure-theoretical lower and upper entropies $\underline{h}_\mu(T)$, $\bar{h}_\mu(T)$ for any $\mu\in M(X)$, where $M(X)$ denotes the collection of all Borel probability measures…

Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $\phi\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $\phi$ is $R$-close to the identity…

In this note we study when an invariant probability measure lifts to an invariant measure. Consider a standard Borel space $X$, a Borel probability measure $\mu$ on $X$, a Borel map $T \colon X \to X$ preserving $\mu$, a compact metric…

We say that $f:[0,1]\to [0,1]$ is a {\it piecewise continuous interval map} if there exists a partition $0=x_0<x_1<\cdots<x_{d}<x_{d+1}=1$ of $[0,1]$ such that $f\vert_{(x_{i-1},x_i)}$ is continuous and the lateral limits $w_0^+=\lim_{x\to…

A complete partition of a graph $G$ is a partition of the vertex set such that there is at least one edge between any two parts. The largest $r$ such that $G$ has a complete partition into $r$ parts, each of which is an independent set, is…