Related papers: Existence results for Kazdan-Warner type equations…

Dirac (1952) proved that every connected graph of order $n>2k+1$ with minimum degree more than $k$ contains a path of length at least $2k+1$. Erd\H{o}s and Gallai (1959) showed that every $n$-vertex graph $G$ with average degree more than…

Menger's Edge Theorem asserts that there exist $k$ pairwise edge-disjoint paths between two vertices in an undirected graph if and only if a deletion of any $k-1$ or less edges does not disconnect these two vertices. Alternatively, there…

Equation $(-\Delta+k^2)u+f(u)=0$ in $D$, $u\mid_{\partial D}=0$, where $k=\const>0$ and $D\subset\R^3$ is a bounded domain, has a solution if $f:\R\to\R$ is a continuous function in the region $|u|\geq a$, piecewise-continuous in the region…

Given a simple connected non-directed graph $G=(V(G),E(G))$, we consider two families of graph invariants: $RX_\Sigma(G) = \sum_{uv \in E(G)} F(r_u,r_v)$ (which has gained interest recently) and $RX_\Pi(G) = \prod_{uv \in E(G)} F(r_u,r_v)$…

In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G satisfying certain isoperimetric inequality. Following the idea of W. Ding, we prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of any…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

The global existence for semilinear wave equations with space-dependent critical damping $\partial_t^2u-\Delta u+\frac{V_0}{|x|}\partial_t u=f(u)$ in an exterior domain is dealt with, where $f(u)=|u|^{p-1}u$ and $f(u)=|u|^p$ are in mind.…

The classical Andr\'{a}sfai--Erd\H{o}s--S\'{o}s Theorem states that for $\ell\ge 2$, every $n$-vertex $K_{\ell+1}$-free graph with minimum degree greater than $\frac{3\ell-4}{3\ell-1}n$ must be $\ell$-partite. We establish a simple…

We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…

We investigate the impact of a high-degree vertex in Tur\'{a}n problems for degenerate hypergraphs (including graphs). We say an $r$-graph $F$ is bounded if there exist constants $\alpha, \beta>0$ such that for large $n$, every $n$-vertex…

We show that a discrete harmonic function which is bounded on a large portion of a periodic planar graph is constant. A key ingredient is a new unique continuation result for the weighted graph Laplacian. The proof relies on the structure…

The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…

Answering a question of Erd\H{o}s and Hajnal, Chen and Ma proved that for all \(n\geq600\) every graph with \(2n + 1\) vertices and at least \(n^2 + n+1\) edges contains two vertices of equal degree connected by a path of length three. The…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

For finite sequence $\underbar{\em d}$ of positive integers, we consider graphs that have $\underbar{\em d}$ as their list of vertex degrees, and bipartite graphs for which each part has $\underbar{\em d}$ as its list of vertex degrees. In…

Let $\mathscr G:= (V,E)$ be a weighted locally finite graph whose finite measure $\mu$ has a positive lower bound. Motivated by wide interest in the current literature, in this paper we study the existence of classical solutions for a class…

A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. Such colorings have…

By using the abstract version of Struwe's monotonicity-trick we prove the existence of a positive solution to the problem (-\Delta)^s u + K u = f(x, u) in R^N u\in H^s (R^N), K>0 where f(x, t): R^N\times R \rightarrow R is a Caratheodory…

We prove existence, symmetry and uniqueness of solutions to the fractional Gelfand equation $$ (-\Delta)^s u = e^u \quad \mbox{in $\mathbb{R}$} \quad \mbox{with} \quad \int_{\mathbb{R}} e^u dx < +\infty $$ for all exponents $s \in…

Let $H$ be a graph and let $\delta_{\chi}(H,r)$ denote the infimum of $c$ such that every $H$-free graph with minimum degree at least $cn$ is $r$-colorable. The \textit{chromatic profile} of $H$ is defined to be the values of…