Related papers: Stable minimal graphs in Heisenberg group $\mathbb…

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

Let $G$ be a connected finite simple graph and let $I_G$ be the edge ideal of $G$. The smallest number $k$ for which $\depth S/I_G^k$ stabilizes is denoted by $\dstab(I_G)$. We show that $\dstab(I_G)<\ell(I_G)$ where $\ell(I_G)$ denotes the…

We consider a nonlinear Schr\"odinger equation with focusing nonlinearity of power type on a star graph ${\mathcal G}$, written as $ i \partial_t \Psi (t) = H \Psi (t) - |\Psi (t)|^{2\mu}\Psi (t)$, where $H$ is the selfadjoint operator…

We study stable finiteness of extensions of 2-graph C*-algebras determined by saturated hereditary sets of vertices. We use two iterations of the Pimsner-Voiculescu sequence to calculate the map in K-theory induced by the inclusion of a…

Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…

We prove interior boundedness and H\"{o}lder continuity for the weak solutions of nonlocal double phase equations in the Heisenberg group $\mathbb{H}^n$. This solves a problem raised by Palatucci and Piccinini et. al. in 2022 and 2023 for…

We discuss the notion of submanifolds with boundary with intrinsic $C^1$ regularity in sub-Riemannian Heisenberg groups and we provide some examples. Eventually, we present a Stokes' Theorem for such submanifolds involving the integration…

Let $G$ be a generalized dicyclic group with identity $1$. An inverse closed subset $S$ of $G\setminus\{1\}$ is called minimal if $\langle S\rangle=G$ and there exists some $s\in S$ such that $\langle S\setminus\{s,s^{-1}\} \rangle\neq G$.…

The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph $G$, a tester can decide with good probability whether $G$…

In this note we study a family of graphs of groups over arbitrary base graphs where all vertex groups are isomorphic to a fixed countable sofic group $G$, and all edge groups $H<G$ are such that the embeddings of $H$ into $G$ are identical…

Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cliques. This paper explores a relaxation of the graph density…

We study the existence and uniqueness problem of compact minimal vertical graphs in $\mathbb{H}^n\times\mathbb{R}$, $n\geq 2$, over bounded domains in the slice $\mathbb{H}^n\times\{0\}$, with non-connected boundary having a finite number…

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

We show that the $\beta$--numbers of intrinsic Lipschitz graphs of Heisenberg groups $\mathbb{H}_n$ are locally Carleson integrable when $n \geq 2$. Our technique relies on a recent Dorronsoro inequality \cite{FO} as well as a novel slicing…

In this paper we show that there exists a constant $C>0$ such that for any graph $G$ on $Ck\ln k$ vertices either $G$ or its complement $\bar{G}$ has an induced subgraph on $k$ vertices with minimum degree at least $\frac12(k-1)$. This…

We prove that the inducibility of $P_4$ in ordered monotone balanced bipartite graphs is $2/e^2$, establishing the smallest known graph with transcendental Tur\'an-type density. Moreover, the limit object is a binary graphon, so it…

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

For graphs $F$ and $H$, we say $F$ is Ramsey for $H$ if every $2$-coloring of the edges of $F$ contains a monochromatic copy of $H$. The graph $F$ is Ramsey $H$-minimal if $F$ is Ramsey for $H$ and there is no proper subgraph $F'$ of $F$ so…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Given a (di)graph $H$, we say that a (di)graph $H^\prime$ is an $H$-subdivision if $H^\prime$ is obtained from $H$ by replacing one or more edges with internally vertex-disjoint path(s). Pavez-Sign\'{e} conjectured that for every…