Related papers: Removability of H\"older graphs for continuous sob…
A graphon that is defined on $[0,1]^d$ and is H\"older$(\alpha)$ continuous for some $d\ge2$ and $\alpha\in(0,1]$ can be represented by a graphon on $[0,1]$ that is H\"older$(\alpha/d)$ continuous. We give examples that show that this…
The graph removal lemma states that any graph on n vertices with o(n^{v(H)}) copies of a fixed graph H may be made H-free by removing o(n^2) edges. Despite its innocent appearance, this lemma and its extensions have several important…
A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…
Let $H$ be a fixed graph whose edges are colored red and blue and let $\beta \in [0,1]$. Let $I(H, \beta)$ be the (asymptotically normalized) maximum number of copies of $H$ in a large red/blue edge-colored complete graph $G$, where the…
We consider several examples when the extension graph admits a bipartition compatible with the action of Duflo--Serganova functors.
This paper studies a large class of continuous functions $f:[0,1]\to\mathbb{R}^d$ whose range is the attractor of an iterated function system $\{S_1,\dots,S_{m}\}$ consisting of similitudes. This class includes such classical examples as…
In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemer\'edi's…
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…
We consider bounded open connected sets $\Omega_1, \Omega_2 \subset \mathbb{R}^n$ and Sobolev maps $f: \Omega_1 \times \Omega_2 \subset \mathbb{R}^n \times \mathbb{R}^n$, such that for almost every $x \in \Omega_1 \times \Omega_2$ the weak…
We study removable sets for the Campanato, H\"{o}lder continuous, $L^p_{\text{loc}}$, and Lipschitz functions in Carnot groups. In the former three cases, we characterize removability through the use of capacities with respect to any…
A full interpolation theory for Sobolev functions with smoothness between 0 and 1 and vanishing trace on a part of the boundary of an open set is established. Geometric assumptions are of mostly measure theoretic nature and reach beyond…
We show that there are functions $f$ in the H\"older class $C^{ { \alpha }}[0,1]$, $1< { \alpha }<2$ such that $f|_{A}$ is not convex, nor concave for any $A { \subset } [0,1]$ with $ { \bar { dim }_M } A> { \alpha }-1$. Our earlier result…
The solvability in Sobolev spaces $W^{1,2}_p$ is proved for nondivergence form second order parabolic equations for $p>2$ close to 2. The leading coefficients are assumed to be measurable in the time variable and two coordinates of space…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
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, while it is known to be…
We prove a characterization of the Sobolev spaces $H^\alpha$ on the unit sphere $\mathbb{S}^{d-1}$, where the smoothness index $\alpha$ is any positive real number and $d\geq 2$. This characterization does not use differentiation and it is…
Let $t$ be a positive real number. A graph is called \emph{$t$-tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is…
We study the subsets of metric spaces that are negligible for the infimal length of connecting curves; such sets are called metrically removable. In particular, we show that every totally disconnected set with finite Hausdorff measure of…
Given a graph $G=(V,E)$, a subset $X$ of $V$ is an interval of $G$ provided that for any $a, b\in X$ and $ x\in V \setminus X$, $\{a,x\}\in E$ if and only if $\{b,x\}\in E$. For example, $\emptyset$, $\{x\}(x\in V)$ and $V$ are intervals of…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…