相关论文: Falconer-type results for any finite graph with mu…

For a non-negative integer $k$, a vertex cut in a graph is $k$-degenerate if it induces a $k$-degenerate subgraph. We show that a graph of order $n$ at least $2k+2$ without a $k$-degenerate cut has the size at least…

Let $G$ be a connected graph with $V(G)=\{v_1,\ldots,v_n\}$. The $(i,j)$-entry of the distance matrix $D(G)$ of $G$ is the distance between $v_i$ and $v_j$. In this article, using the well-known Ramsey's theorem, we prove that for each…

Let $f$ be a nonnegative integer valued function on the vertex set of a graph. A graph is \textbf{strictly $f$-degenerate} if each nonempty subgraph $\Gamma$ has a vertex $v$ such that $\mathrm{deg}_{\Gamma}(v) < f(v)$. In this paper, we…

For an undirected graph G=(V,E), a vertex x \in V separates vertices u and v (where u,v \in V, u \neq v) if their distances to x are not equal. Given an integer parameter k \geq 1, a set of vertices L \subseteq V is a feasible solution if…

Let F be a finite family of graphs. In the F-Deletion problem, one is given a graph G and an integer k, and the goal is to find k vertices whose deletion results in a graph with no minor from the family F. This may be regarded as a…

The Alon-Tarsi number of a graph $ G $ is the smallest $ k $ such that there exists an orientation $ D $ of $ G $ with maximum outdegree $ k - 1 $ satisfying that the number of even Eulerian subgraphs is different from the number of odd…

We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…

An orientation $D$ of a graph $G=(V,E)$ is a digraph obtained from $G$ by replacing each edge by exactly one of the two possible arcs with the same end vertices. For each $v \in V(G)$, the indegree of $v$ in $D$, denoted by $d^-_D(v)$, is…

For a graph $G=(V,E)$ and a set $S\subseteq V(G)$ of size at least $2$, an $S$-Steiner tree $T$ is a subgraph of $G$ that is a tree with $S\subseteq V(T)$. Two $S$-Steiner trees $T$ and $T'$ are internally disjoint (resp. edge-disjoint) if…

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…

An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of…

This paper studies generalizations of the concept of acyclic orientations to arc-weighted orientations. These lead to four types of variations of strict degeneracy of graphs. Some of these variations are studied in the literature under…

A monitoring edge-geodetic set of a graph is a subset $M$ of its vertices such that for every edge $e$ in the graph, deleting $e$ increases the distance between at least one pair of vertices in $M$. We study the following computational…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

The classical Menger's theorem states that in any undirected (or directed) graph $G$, given a pair of vertices $s$ and $t$, the maximum number of vertex (edge) disjoint paths is equal to the minimum number of vertices (edges) needed to…

Let $G$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A $k$-matching of a graph $G$ is a function $f:E(G)\rightarrow \{0,1,\ldots, k\}$ satisfying $\sum_{e \in E_G(v)} f(e) \leq k$ for every vertex $v \in V(G)$,…

We show that if a compact set $E\subset \mathbb{R}^d$ has Hausdorff dimension larger than $\frac{d}{2}+\frac{1}{4}-\frac{1}{8d+4}$, where $d\geq 3$, then there is a point $x\in E$ such that the pinned distance set $\Delta_x(E)$ has positive…

Given a fixed graph $H$, a real number $p\in(0,1)$, and an infinite Erd\H{o}s-R\'enyi graph $G\sim G(\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number…

For a nondegenerate $r$-graph $F$, large $n$, and $t$ in the regime $[0, c_{F} n]$, where $c_F>0$ is a constant depending only on $F$, we present a general approach for determining the maximum number of edges in an $n$-vertex $r$-graph that…

The concept of pedant tree-connectivity was introduced by Hager in 1985. For a graph $G=(V,E)$ and a set $S\subseteq V(G)$ of at least two vertices, \emph{an $S$-Steiner tree} or \emph{a Steiner tree connecting $S$} (or simply, \emph{an…