A Counting Proof of the Graham Pollak Theorem
英文摘要：
We give a counting based proof of the Graham Pollak Theorem
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Improved Bounds for the Graham-Pollak Problem for Hypergraphs
For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-graphs needed to partition the complete $r$-graph on $n$ vertices. The Graham-Pollak theorem asserts that $f_2(n)=n-1$. An easy construction shows that $f_r(n) \leq (1+o(1))\binom{n}{\lfloor r/2 \rfloor}$, and we write $c_r$ for the least number such that $f_r(n) \leq c_r (1+o(1))\binom{n}{\lfloor r/2 \rfloor}$. It was known that $c_r < 1$ for each even $r \geq 4$, but this was not known for any odd value of $r$. In this short note, we prove that $c_{295}<1$. Our method also shows that $c_r \rightarrow 0$, answ…
math.CO
Bounds for the Graham-Pollak Theorem for Hypergraphs
Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of $(1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ was known. Recently this was improved to $\frac{14}{15}(1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ for even $r \geq 4$. A bound of $\bigg[\frac{r}{2}(\frac{14}{15})^{\frac{r}{4}}+o(1)\bigg](1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ was also proved recently. The smallest odd $r$ for which $c_r < 1$ th…
math.CO
Graham-Pollak树定理到偶数阶Steiner距离的推广
A Generalization of the Graham-Pollak Tree Theorem to Even-Order Steiner Distance
本文将Graham-Pollak树定理推广到Steiner距离，证明偶数阶Steiner距离超行列式恒非零，并结合奇数阶恒为零的已有结果，猜想其值仅依赖于阶数和顶点数。
math.CO
Graham-Pollak树定理到Steiner距离的推广
A Generalization of the Graham-Pollak Tree Theorem to Steiner Distance
本文将Graham-Pollak关于树距离矩阵行列式的定理推广到Steiner距离，证明所有奇数阶Steiner距离超矩阵的行列式仅依赖顶点数，并猜想偶数阶同样成立。
cs.DMmath.CO
一个类似于 Graham-Pollak 定理的新结果
A new result similar to the Graham-Pollak theorem
本文研究了树的结构与距离矩阵行列式的关系，提出并证明了一个类似于 Graham-Pollak 定理的新结果，推导出了基于复数权重和加权距离的行列式公式，并进一步扩展得到了更一般的结论。
math.CO
关于超图的格雷厄姆-波拉克定理的新界限
New bounds on the Graham-Pollak theorem for hypergraphs
National Institute of Technology Calicut（印度国立卡尔库特技术学院）
本文改进了超图格雷厄姆-波拉克定理的界限，将c_r的最小值从113降低到85，并提高了f_r(n)的界限。
cs.DMmath.CO
更多相关论文收起更多论文
不相交路径与树的距离矩阵的行列式
Non-intersecting paths and the determinant of the distance matrix of a tree
本文通过符号反转对合与Lindström-Gessel-Viennot引理，首次给出了树的距离矩阵行列式的Graham-Pollak公式的组合证明，并为理解其现有推广与$q$-模拟提供了统一框架。
math.CO
A fancy way to obtain the binary digits of $759250125\sqrt{2}$
R. L. Graham and H. O. Pollak observed that the sequence $$u_1=1,\qquad u_{n+1}=\lfloor \sqrt{2} (u_n+1/2)\rfloor, \quad n\geq 1,$$ has the curious property that the sequence of numbers $(u_{2n+1}-2u_{2n-1})_{n\geq 1}$ denotes the binary digits of $\sqrt{2}$. We present an extension of Graham--Pollak's sequence which allows to get -- in a fancy way -- the binary digits of $759250125\sqrt{2}$ and other numbers.
math.COmath.NT
树的距离矩阵行列式的齐次线性递推关系
Homogeneous linear recurrence relations of the determinants of distance matrices of trees
本文通过分析树的子树结构，建立了距离矩阵行列式的四项至七项齐次线性递推关系，并由此给出Graham-Pollak公式的新证明。
math.CO
分割图的精确双 clique 分解数
Exact Biclique Partition number of Split Graphs
研究分割图的双 clique 分解数，证明其等于补图最大 clique 数减一，扩展了格雷厄姆-波拉克定理的应用范围。
cs.DMmath.CO
