相关论文: A Note on Graph Pebbling

A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…

A strong edge coloring of a graph $G$ is an edge coloring $\phi\,:\,E(G) \rightarrow \mathbb N$ such that each color class forms an induced matching in $G$. The strong chromatic index of $G$, written $\chi'_s(G)$, is the minimum number of…

A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group Gamma' whose order is at least the order of Gamma. Jaeger,…

We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore…

The burning number of a graph $G$ is the smallest positive integer $k$ such that the vertex set of $G$ can be covered with balls of radii $0, 1, \dots, k-1$. A well-known conjecture by Bonato, Janssen and Roshabin states that any connected…

We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

For $S\subseteq V(G)$ and $|S|\geq 2$, $\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\leq k\leq n$, the \emph{generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is then…

It is shown that $S(G) = O\left(m/\log_2 m + d\right)$ pebbles are sufficient to pebble any DAG $G=(V,E)$, with $m$ edges and maximum in-degree $d$. It was previously known that $S(G) = O\left(d n/\log n\right)$. The result builds on two…

A graph operator is a function $\Gamma$ defined on some set of graphs such that whenever two graphs $G$ and $H$ are isomorphic, written $G\simeq H$, then $\Gamma(G)\simeq \Gamma(H)$. For a graph $G$ not in the domain of $\Gamma$, we put…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$, introduced by Jord\'an and Tanigawa, is a quantitative measure of the $d$-dimensional rigidity of $G$ that is defined in terms of the eigenvalues of stiffness…

We show that for sufficiently large $d$ and for $t\geq d+1$, there is a graph $G$ with average degree $(1-\varepsilon)\lambda t \sqrt{\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$,…

Erd\H{o}s, Faudree, Rousseau and Schelp observed the following fact for every fixed integer $k\geq 2$: Every graph on $n\geq k-1$ vertices with at least $(k-1)(n-k+2)+{k-2\choose 2}$ edges contains a subgraph with minimum degree at least…

A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

Let $\mathcal{A}$ be a set of connected graphs. Then a spanning subgraph $A$ of $G$ is called an $\mathcal{A}$-factor if each component of $A$ is isomorphic to some member of $\mathcal{A}$. Especially, when every graph in $\mathcal{A}$ is a…