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

An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. The notion of removable edge arises in connection with ear decompositions of matching covered graphs introduced by Lov\'asz and Plummer. A…

The Zygmund functions form an intermediate class between Lipschitz and H\"older functions; their second order divided differences are uniformly bounded. It is well known that for $d \geq 1$ the graph of any Lipschitz function $f:\R^d…

We investigate the question whether the $L^1(\mathbb R)$-norm of the second derivative of the uncentered Hardy-Littlewood maximal function can be bounded by a constant times the $L^1(\mathbb R)$-norm of the function itself. We give a…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…

There are at least two directions concerning the extension of classical sharp Hardy-Littlewood-Sobolev inequality: (1) Extending the sharp inequality on general manifolds; (2) Extending it for the negative exponent $\lambda=n-\alpha$ (that…

A hole in a graph is an induced cycle of length at least $4$. Let $s\ge2$ and $t\ge2$ be integers. A graph $G$ is $(s,t)$-splittable if $V(G)$ can be partitioned into two sets $S$ and $T$ such that $\chi(G[S ]) \ge s$ and $\chi(G[T ]) \ge…

We prove the following 30-year old conjecture of Gy\H{o}ri and Tuza: the edges of every $n$-vertex graph $G$ can be decomposed into complete graphs $C_1,\ldots,C_\ell$ of orders two and three such that $|C_1|+\cdots+|C_\ell|\le…

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…

We establishe an affine Hardy-Littlewood-Sobolev inequality concerning two different functions which is stronger than the classical Hardy-Littlewood-Sobolev inequality. Furthermore, we also prove reverse inequalities for the new…

A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence…

It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For…

Examples by Poletsky and the author and by Zwonek show the existence nowhere extendable holomorphic functions with the property that the pluripolar hull of their graphs is much larger than the graph of the respective functions and contains…

Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ…

A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological order (temporal paths). This form of reachability is neither…

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

In the Euclidean setting the Sobolev spaces $W^{\alpha,p}\cap L^\infty$ are algebras for the pointwise product when $\alpha>0$ and $p\in(1,\infty)$. This property has recently been extended to a variety of geometric settings. We produce a…

A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. If $G$ is a cubic…

We prove that if $M$ and $N$ are Riemannian, oriented $n$-dimensional manifolds without boundary and additionally $N$ is compact, then Sobolev mappings $W^{1,n}(M,N)$ of finite distortion are continuous. In particular, $W^{1,n}(M,N)$…

We establish simple pointwise characterizations of functions in the Hardy-Sobolev spaces within the range n/(n+1)<p <=1. In addition, classical Hardy inequalities are extended to the case p <= 1.

The resistance $r(G)$ of a graph $G$ is the minimum number of edges that have to be removed from $G$ to obtain a graph which is $\Delta(G)$-edge-colorable. The paper relates the resistance to other parameters that measure how far is a graph…