Related papers: Removability of H\"older graphs for continuous sob…

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic…

In this note we generalize a result from a recent paper of Hajac, Reznikoff and Tobolski (2020). In that paper they give conditions they call admissibility on a pushout diagram in the category of directed graphs implying that the…

We prove a conjecture of Dvo\v{r}\'ak, Kr\'al, Nejedl\'y, and \v{S}krekovski that planar graphs of girth at least five are square $(\Delta+2)$-colorable for large enough $\Delta$. In fact, we prove the stronger statement that such graphs…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms…

We begin with an improvement to an extension result for subharmonic functions of Blanchet et al. With the aid of this improvement we then give extension results for subharmonic functions, for separately subharmonic functions, for harmonic…

It is shown that an arbitrary function from $D\subset \R^n$ to $\R^m$ will become $C^{0,\alpha}$-continuous in almost every $x\in D$ after restriction to a certain subset with limit point $x$. For $n\geq m$ differentiability can be…

We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…

We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.

Let $\mathbf{\Gamma} = (V,E)$ be a (non-trivial) finite graph with $\lambda: E \rightarrow \mathbb{R}_{+}$, an edge labelling of $\mathbf{\Gamma}$. Let $\rho : V\rightarrow \mathbb{R}^{2}$ be a map which preserves the edge labelling. The…

This paper introduces first order Sobolev spaces on certain rectifiable varifolds. These complete locally convex spaces are contained in the generally nonlinear class of generalised weakly differentiable functions and share key functional…

Let k be an algebraically closed field of characteristic 0. The question of irreducibility of the punctual Hilbert scheme Hilb_d P^n and its Gorenstein locus for various d was studied in [CEVV8, CN9, CN10, CN11]. In this short paper we…

This paper deals with the embedding of the Sobolev spaces of fractional order into the space of H\"older continuous functions. More precisely, we show that the function $f\in H^s(\mathbb{R})$ with $\frac{1}{2}<s<1$ is H\"older continuous…

A graph $G$ is \emph{$(a,b)$-choosable} if given any list assignment $L$ with $|L(v)|=a$ for each $v\in V(G)$ there exists a function $\varphi$ such that $\varphi(v)\in L(v)$ and $|\varphi(v)|=b$ for all $v\in V(G)$, and whenever vertices…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

For a continuous function $f:\mathbb{R}\to\mathbb{R}$, define the corresponding graph by setting \[\Gamma_f := {(x1, f(x1)) : x_1\in\mathbb{R}} .\] In this paper, we study the Sobolev extension property for the upper and lower domains over…

We prove that Graph Isomorphism and Canonization in graphs excluding a fixed graph $H$ as a minor can be solved by an algorithm working in time $f(H)\cdot n^{O(1)}$, where $f$ is some function. In other words, we show that these problems…

A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…

We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…