Related papers: A note on measure-theoretic domatic partitions

Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…

Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…

We define and study a natural category of graph limits. The objects are pairs $(\pi,\mu)$, where $\pi$ (the distribution of vertices) is an abstract probability measure on some abstract measurable space $(X,\mathcal{A})$ and $\mu$ (the…

A notion of degree-coloring is introduced; it captures some, but not all properties of standard edge-coloring. We conjecture that the smallest number of colors needed for degree-coloring of a multigraph $G$ [the degree-coloring index…

Let $G=G(n)$ be a graph on $n$ vertices with maximum degree $\Delta=\Delta(n)$. Assign to each vertex $v$ of $G$ a list $L(v)$ of colors by choosing each list independently and uniformly at random from all $k$-subsets of a color set…

We extend classical notions of definable colourability of graphs to the general projective setting and investigate whether known results, mainly about the $G_0$ dichotomy and the $2n + 1$ conjecture, hold in the context of higher projective…

Given a graph $G$, a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x,y\in V(G)$ with a same color, if there is a shortest $x,y$-path whose internal vertices have different colors than $x,y$. The smallest…

For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$…

We show that every locally finite bipartite Borel graph satisfying a strengthening of Hall's condition has a Borel perfect matching on some comeager invariant Borel set. We apply this to show that if a group acting by Borel automorphisms on…

We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…

In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…

Let $\Gamma$ be a finitely generated group acting by probability measure preserving maps on the standard Borel space $(X,\mu)$. We show that if $H\leq\Gamma$ is a subgroup with relative spectral radius greater than the global spectral…

A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…

We show that the collection of regular Borel measures on a second-countable locally compact Hausdorff space has the structure of a sheaf. With this we give an alternate description of the pullback of a regular Borel measure along a local…

We prove that every usco multimap $\Phi:X\to Y$ from a metrizable separable space $X$ to a GO-space $Y$ has an $F_\sigma$-measurable selection. On the other hand, for the split interval $\ddot{\mathbb I}$ and the projection $P:\ddot{\mathbb…

The $\mathbb{G}_0$-dichotomy due to Kechris, Solecki and Todor\vcevi\'c characterizes the analytic relations having a Borel-measurable countable coloring. We give a version of the $\mathbb{G}_0$-dichotomy for $\boraxi$-measurable countable…

We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…

For any standard Borel space $B$, let $\mathcal{P}(B)$ denote the space of Borel probability measures on $B$. In relation to a difficult problem of Aldous in exchangeability theory, and in connection with arithmetic combinatorics, Austin…