Related papers: Dimensions of graphs of prevalent continuous maps
We determine the Hausdorff, packing and box-counting dimension of a family of self-affine sets generalizing Bara\'nski carpets. More specifically, we fix a Bara\'nski system and allow both vertical and horizontal random translations, while…
For a graph $F$, the $k$-subdivision of $F$, denoted $F^k$, is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$. In this paper, we prove that…
In a recent paper, Gerbner, Patk\'{o}s, Tuza and Vizer studied regular $F$-saturated graphs. One of the essential questions is given $F$, for which $n$ does a regular $n$-vertex $F$-saturated graph exist. They proved that for all…
The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…
Let $f$ be a conformal (analytic and univalent) map defined on the open unit disk $\D$ of the complex plane $\IC$ that is continuous on the semi-circle $\partial \D^{+}=\{z\in\IC:|z|=1, {\rm{Im}}\,z>0\}$. The existence of a uniform upper…
Let $G$ be a graph with vertex set $V(G)$. For any two distinct vertices $x$ and $y$ of $G$, let $R\{x, y\}$ denote the set of vertices $z$ such that the distance from $x$ to $z$ is not equal to the distance from $y$ to $z$ in $G$. For a…
A {\em $k$-kernel} in a digraph $G$ is a stable set $X$ of vertices such that every vertex of $G$ can be joined from $X$ by a directed path of length at most $k$. We prove three results about $k$-kernels. First, it was conjectured by…
Let $X$ be a Polish space. We prove that the generic compact set $K\subseteq X$ (in the sense of Baire category) is either finite or there is a continuous gauge function $h$ such that $0<\mathcal{H}^{h}(K)<\infty$, where $\mathcal{H}^h$…
This paper studies edge-precoloring extensions in Cartesian products of graphs, motivated by a conjecture of Casselgren, Petros, and Fufa. We formulate a general hypothesis stating that if every edge-precoloring of $G$ and $H$ of sizes…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…
A set $B$ of vertices in a graph $G$ is called a \emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$,…
We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…
A $(d,k)$-set is a subset of $\mathbb{R}^d$ containing a $k$-dimensional unit ball of all possible orientations. Using an approach of D.~Oberlin we prove various Fourier dimension estimates for compact $(d,k)$-sets. Our main interest is in…
Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…
An $\mathcal{F}$-saturated $r$-graph is a maximal $r$-graph not containing any member of $\mathcal{F}$ as a subgraph. Let $\mathcal{K}_{\ell + 1}^{r}$ be the collection of all $r$-graphs $F$ with at most $\binom{\ell+1}{2}$ edges such that…
A {\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in common. The {\it $m$-krausz} dimension $kdim_m(G)$ of…
We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…
An \emph{$H$-packing} in a graph $G$ is a collection of pairwise vertex-disjoint copies of $H$ in $G$. We prove that for every $c > 0$ and every bipartite graph $H$, any $\lfloor cn \rfloor$-regular graph $G$ admits an $H$-packing that…
Consider a dominant rational self-map $f$ on a smooth projective variety $X$ defined over $\overline{\mathbb{Q}}$. We prove that \begin{align} \lim_{n \to \infty} \frac{h_{Y}(f^{n}(x))}{h_{H}(f^{n}(x)) } = 0, \end{align} where $h_{Y}$ is a…