Skip to main content
QUICK REVIEW

[论文解读] A note on Ramsey numbers for minors

Maria Axenovich, Steiner, Raphael|arXiv (Cornell University)|Mar 11, 2026
Limits and Structures in Graph TheoryMathematics被引用 0
一句话总结

该论文为每个图 F 确定渐近的 R_h(F;2)(因此得到 R_h(k) 和 R_h(k;2)),并且在 ℓ≫k≫1 时给出 R_h(k;ℓ) 的渐近行为,将关于子图的冯曼性问题与 Myers–Thomason 常数联系起来。

ABSTRACT

Let $R_h(k; \ell)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $\ell$ colors results in a monochromatic $K_k$-minor, in other words, a graph with Hadwiger number $k$, i.e., a graph that could be transformed into a clique $K_k$ on $k$ vertices via a sequence of edge contractions and vertex deletions. More generally, for a graph $F$ and integer $\ell$ let $R_h(F;\ell)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $\ell$ colors results in a monochromatic $F$-minor. In 2001 Thomason and in 2005 Myers and Thomason asymptotically determined the extremal numbers for clique minors and $F$-minors, respectively. They found the respective explicitly computable leading constants $β=0.265656...$ and $γ(F)\cdot β$ for these extremal numbers. We determine $R_h(F;2)$ for every graph $F$ as $$R_h(F;2)=(γ(F)+o(1))|V(F)|\sqrt{\log_2(|V(F)|)},$$ where the $o(1)$-term tends to zero as $|V(F)| ightarrow \infty$. In particular, $$R_h(k;2)=(1+o(1))k\sqrt{\log_2 k}.$$ When $\ell\gg k \gg 1$, we show that $$ R_h(k; \ell) = (2β+o(1)) \ell k \sqrt{\log_2 k}.$$

研究动机与目标

  • 在 Hadwiger 数的背景下,激发并定义 minor-Ramsey 数 R_h(F;ℓ) 与 R_h(k;ℓ) 。
  • 确定对于任意 F(因此包括 R_h(k;2) 和 R_h(k))的 R_h(F;2) 的渐近值。
  • 在 ℓ≫k≫1 时,确定 R_h(k;ℓ) 的渐近行为。
  • 将 Ramsey-minor 数与 Thomason、Myers、Thomason 的极值结果联系起来。
  • 给出 R_h(3)、R_h(4) 的精确小 k 值和界限。

提出的方法

  • 利用 Myers–Thomason 对 c(F) 与 γ(F) 的结果,通过概率构造与密度论证推导 R_h(F;2)。
  • 应用上界和下界技巧:随机着色与子图嵌入阈值(定理 1.5–1.7)来界定 R_h(F;2)。
  • 通过基于密度和连通性的论证处理子图具有高最小度或高连通性的情形(主证中的案例分析)。
  • 通过案例分析与已知的 minor-极值界(如 Hadwiger 相关界限)导出小 k 的精确值(如 R_h(3)=5、R_h(4)=7)。
  • 将分析扩展到两色与多色情形,得到渐近结果如 R_h(k;2) = (1+o(1)) k √log k 与 R_h(k;ℓ) ≈ 2β ℓ k √log k(当 ℓ large 时)。”] ,
  • research_questions([
  • minor-Ramsey 数 R_h(F;2) 对任意 k 个顶点的一般图 F 的渐近行为是什么?
  • R_h(k;2) 与 γ(F) 参数及 Myers–Thomason 常数之间的关系如何?
  • 当颜色数 ℓ 远大于 k 时,R_h(k;ℓ) 的渐近形式是什么?
  • 对小 k 的精确值或紧界限(如 R_h(3)、R_h(4))是多少?
  • minor-Ramsey 框架是否能对稀疏图(如树或星形)给出精确结果,且在哪些情形下?

实验结果

研究问题

  • RQ1What is the asymptotic behavior of the minor-Ramsey number R_h(F;2) for a general graph F with k vertices?
  • RQ2How does R_h(k;2) relate to the γ(F) parameter and the Myers–Thomason constants?
  • RQ3What is the asymptotic form of R_h(k;ℓ) when the number of colors ℓ is much larger than k?
  • RQ4What are the exact values or tight bounds for small k, such as R_h(3) and R_h(4)?
  • RQ5Can the minor-Ramsey framework yield precise results for sparse graphs (e.g., trees or stars) and in what regimes?

主要发现

  • R_h(F;2) = (γ(F) + o(1)) k √(log k) for every graph F on k vertices, hence R_h(k) = (1 + o(1)) k √(log k).
  • R_h(3) = 5 and R_h(4) = 7; for k ≥ 5, 2k−2 ≤ R_h(k) ≤ 32(k−2) ⌊log(k−2)⌋ + 1.
  • For ℓ ≫ k ≫ 1, R_h(k;ℓ) = (2β + o(1)) ℓ k √(log k), where β = 0.265656...; and R_h(3;ℓ) = 2ℓ + 1.
  • The constants γ(F) and β from Myers–Thomason govern the density-based lower/upper bounds via c(F) ≈ γ(F) β k √(log k).
  • The work confirms the two-color minor-Ramsey asymptotics and provides the large-ℓ regime, linking to complete-minor extremal results and density arguments.

阅读本论文

在 Nubint 阅读器中打开原文,边读边就任意段落提问。

在 Nubint 中阅读本论文

本解读由 AI 根据论文原文生成,引用前请核对原文。