Related papers: Dimensions of graphs of prevalent continuous maps

Fractal measures of images of continuous maps from the set of p-adic numbers Qp into complex plane C are analyzed. Examples of "anomalous" fractals, i.e. the sets where the D-dimensional Hausdorff measures (HM) are trivial, i.e. either…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

Since the recent dissertation by Steffen Winter, for certain self-similar sets $F$ the growth behaviour of the Minkowski functionals of the parallel sets $F_\varepsilon := \{x\in \mathbb R^d : d(x,F)\leq \varepsilon\}$ as $\varepsilon…

The aim of this paper is to study the dimensions and standard part maps between the field of $p$-adic numbers ${{\mathbb Q}_p}$ and its elementary extension $K$ in the language of rings $L_r$. We show that for any $K$-definable set…

Let $E \subseteq \mathbb{R}^n$ be a union of line segments and $F \subseteq \mathbb{R}^n$ the set obtained from $E$ by extending each line segment in $E$ to a full line. Keleti's line segment extension conjecture posits that the Hausdorff…

Let $H$ be a fixed graph. A {\em fractional $H$-decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G)$, the sum of the weights of copies of $H$ containing $e$…

Let $K$ be a compact Hausdorff space and let $(f_n)_{n\in \N}$ be a pairwise disjoint sequence of continuous functions from $K$ into $[0,1]$. We say that a compact space $L$ \emph{adds supremum} of $(f_n)_{n\in \N}$ in $K$ if there exists a…

Let $K$ be the attractor of a linear iterated function system (IFS) $S_j(x)=\rho_jx+b_j,$ $j=1,\cdots,m$, on the real line satisfying the generalized finite type condition (whose invariant open set $\mathcal{O}$ is an interval) with an…

Let $(X,d)$ be a metric space. A set $S\subseteq X$ is said to be a $k$-metric generator for $X$ if and only if for any pair of different points $u,v\in X$, there exist at least $k$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne…

Alon, Krivelevich, and Sudakov conjectured in 1999 that every $F$-free graph of maximum degree at most $\Delta$ has chromatic number $O(\Delta / \log \Delta)$. This was previously known only for almost bipartite graphs, that is, for…

Mixed fault diameter of a graph $G$, $ \D_{(a,b)}(G)$, is the maximal diameter of $G$ after deletion of any $a$ vertices and any $b$ edges. Special cases are the (vertex) fault diameter $\D^V_{a} = \D_{(a,0)}$ and the edge fault diameter…

Let $K \subset \mathbb{R}^{2}$ be a rotation and reflection free self-similar set satisfying the strong separation condition, with dimension $\dim K = s > 1$. Intersecting $K$ with translates of a fixed line, one can study the $(s -…

Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

More than thirty years ago, Erd\H{o}s, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no…

Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the technique of Gr\"obner bases and initial ideals, it will be proved that, given integers $f$ and $d$ with $7 \leq f \leq d$, there exists a finite graph $G$ on…

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…