首页/论文/2002.09092

arXiv 2002.090922020-02-21math.CO

Progress on sufficient conditions for a graph to have a spanning $k-$ended tree

Pham Hoang Ha

备注：: 6 pages

英文摘要：

In 1998, Broersma and Tuinstra [J. Graph Theory \textbf{29} (1998), 227-237] proved that if $G$ is a connected graph satisfying $σ_2(G) \geq |G|-k+1$ then $G$ has a spanning $k-$ended tree. They also gave an example to show that the condition "$σ_2(G) \geq |G|-k+1$" is sharp. In this paper, we introduce a new progress for this result. Let $K_{m,m+k}$ be a complete bipartite graph with bipartition $V(K_{m,m+k})=A\cup B, |A|=m, |B|=m+k.$ Denote by $H$ to be the graph obtained from $K_{m,m+k}$ by adding (or no adding) some edges with two end vertices in $A.$ We prove that if $G$ is a connected graph satisfying $σ_2(G) \geq |G|-k$ then $G$ has a spanning $k-$ended tree except for the case $G$ is isomorphic to a graph $H.$ As a corollary of our main result, a sufficient condition for a graph to have a few branch vertices is given.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Spanning k-ended trees of 3-regular connected graphs

A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-ended tree. At the end we give a conjecture about spanning k-ended trees on 3-regular connected graphs.

2016-06-21math.CO

On $k$-ended spanning and dominating trees

A tree with at most $k$ leaves is called a $k$-ended tree. A spanning 2-ended tree is a Hamilton path. A Hamilton cycle can be considered as a spanning 1-ended tree. The earliest result concerning spanning trees with few leaves states that if $k$ is a positive integer and $G$ is a connected graph of order $n$ with $d(x)+d(y)\ge n-k+1$ for each pair of nonadjacent vertices $x,y$, then $G$ has a spanning $k$-ended tree. In this paper, we improve this result in two ways, and an analogous result is proved for dominating $k$-ended trees based on the generalized parameter $t_k$ - the order of a larg…

2014-09-08math.CO

$t$-连通图中生成$k$-端树的谱条件

Spectral condition for spanning $k$-ended trees in $t$-connected graphs

该研究针对$t$-连通图中生成$k$-端树的存在性问题，给出了紧的谱半径条件，推广了已有相关研究结果。

2023-05-07math.CO

$t$-连通图中生成 $k$-树或 $k$-端树存在的谱条件

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs

本文研究 $t$-连通图中生成 $k$-树与生成 $k$-端树的存在性，给出若干新的谱充分条件，并推广和改进了多项已有结果。

2025-06-09math.CO

可测的单端生成树

Measurable one-ended spanning trees

本文证明了标准概率空间上的单端局部有限可测图存在可测单端生成子树的充要条件是测度超有限性，从而回答了Bowen等人提出的问题并推广了Timár等的最新结果。

2025-09-19math.COmath.LOmath.PR

One-ended spanning trees and definable combinatorics

Let $(X,τ)$ be a Polish space with Borel probability measure $μ,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of an amenable (resp., polynomial growth) group then we show the same result $μ$-a.e. (resp., everywhere). Our results generalize recent work of Timár, as well as of Conley, Gaboriau, Marks, and Tucker-Drob, who proved this in the probability measure preserving setting. We apply our theorem to find Borel orientations in even degree graphs and measurable and Baire mea…

2022-10-25math.COmath.LO

更多相关论文收起更多论文

Spectral radius and spanning trees of graphs

For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide tight spectral conditions to guarantee the existence of a spanning $k$-ended-tree in a connected graph of order $n$ with extremal graphs being characterized. Moreover, by adopting Kaneko's theorem [Spanning trees with constraints on the leaf degree, Discrete Appl. Math. 115 (2001) 73--76], we also present tight spectral conditions for the existence of a spann…

2022-12-11math.CO

Hamilton decompositions of one-ended Cayley graphs

We prove that any one-ended, locally finite Cayley graph with non-torsion generators admits a decomposition into edge-disjoint Hamiltonian (i.e. spanning) double-rays. In particular, the $n$-dimensional grid $\mathbb{Z}^n$ admits a decomposition into $n$ edge-disjoint Hamiltonian double-rays for all $n \in \mathbb{N}$.

2017-09-27math.CO

Contraction of graphs and spanning k-end trees

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end vertices and deleting all edges between every two vertex except one edge to gain again a simple graph and is denoted bye G/e. In this paper we prove some theorems related to a graph and its contraction. For example we prove the following theorem. If G is a connected graph that has a spanning k-end tree and |V (G)| > K + 1 then there exist an edge e such G/e …

2016-12-29math.CO

Harmonic functions with finite $p$-energy on lamplighter graphs are constant

The aim of this note is to show that lamplighter graphs where the space graph is infinite and at most two-ended and the lamp graph is at most two-ended do not admit harmonic functions with gradients in $\ell^p$ (\ie finite $p$-energy) for any $p\in [1,\infty[$ except constants (and, equivalently, that their reduced $\ell^p$ cohomology is trivial in degree one). Using similar arguments, it is also shown that many direct products of graphs (including all direct products of Cayley graphs) do not admit non-constant harmonic function with gradient in $\ell^p$. The proof relies on a theorem of Thoma…

2015-12-07math.COmath.GR

生成森林恒等式的一个框架

A framework for spanning forest identities

本文建立生成森林恒等式的框架，研究其通用条件与空间维数，识别全 minors 矩阵树定理给出的映射，证明其秩由Narayana数计数，助力相关领域发展。

2026-10-14math.CO

通过排序网络实现伪随机图中的生成树

Spanning trees in pseudorandom graphs via sorting networks

该研究借助Ajtai等人的对数深度排序网络构造，证明满足λ=O(d/log³n)的(n,d,λ)-图对所有有界度生成树具有通用性，改进了先前的界，推进了2007年提出的相关问题的解决。

2023-11-06math.CO

Every Steiner triple system contains an almost spanning d-ary hypertree

In this paper we make a partial progress on the following conjecture: for every $μ>0$ and large enough $n$, every Steiner triple system $S$ on at least $(1+μ)n$ vertices contains every hypertree $T$ on $n$ vertices. We prove that the conjecture holds if $T$ is a perfect $d$-ary hypertree.

2021-06-18cs.DMmath.CO

最小生成树形图

Minimal spanning arborescence

本文研究有向最小生成树形图的无限体积极限与几何性质，利用 Chu–Liu–Edmonds–Bock 递归算法提出环收缩随机游走，并证明极限存在性与单端性。

2024-01-24cs.DSmath.COmath.PR