Related papers: A note on equitable colorings of forests

If $L$ is a list assignment of $r$ colors to each vertex of an $n$-vertex graph $G$, then an equitable $L$-coloring of $G$ is a proper coloring of vertices of $G$ from their lists such that no color is used more than $\lceil n/r\rceil$…

In this short note, we give an alternative proof of the semipositivity of the Chow-Mumford line bundle for families of K-semistable log-Fano pairs, and of the nefness threeshold for the log-anti-canonical line bundle on families of K-stable…

These notes include introductory material on the notion of splitting fields for modules over a k-algebra where k is a field.

Equivalencies of many basic elementary inequalities are given

We prove an easy statement about inhomogeneous approximation in metric theory of Diophantine Approximation.

In this brief note we draw attention to examples of quantum field theories which may hold interesting lessons for attempts to devise a precise formulation of the Bekenstein bound. Our comments mirror the recent results of Bousso…

We compare two notions of $G$-fiber bundles and $G$-principal bundles in the literature, with an aim to clarify early results in equivariant bundle theory that are needed in current work of equivariant algebraic topology. We also give…

We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…

In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.

We prove that, with high probability, in every $2$-edge-colouring of the random tournament on $n$ vertices there is a monochromatic copy of every oriented tree of order $O (n / \sqrt{\log n})$. This generalises a result of the first, third…

Throughout the last decade, random forests have established themselves as among the most accurate and popular supervised learning methods. While their black-box nature has made their mathematical analysis difficult, recent work has…

While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic…

Although the characterization of ring derivations has an extensive literature, up to now, all of the characterizations have had the following form: additivity and another property imply that the function in question is a derivation. The aim…

We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we…

The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring,…

A signed tree-coloring of a signed graph $(G,\sigma)$ is a vertex coloring $c$ so that $G^{c}(i,\pm)$ is a forest for every $i\in c(u)$ and $u\in V(G)$, where $G^{c}(i,\pm)$ is the subgraph of $(G,\sigma)$ whose vertex set is the set of…

In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.

We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors can occur as the colors of a parent vertex and its child. This…

The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with proper thinness~1 are exactly the proper interval graphs. A…

In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that there is a coloring of E(G) using k colors that does not…