A Note on the Gyrfs-Sumner Conjecture

GRAPHS AND COMBINATORICS(2024)

引用 0|浏览6
暂无评分
摘要
The Gyarfas-Sumner conjecture says that for every tree T and every integer t >= 1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t\ge 1$$\end{document}, if G is a graph with no clique of size t and with sufficiently large chromatic number, then G contains an induced subgraph isomorphic to T. This remains open, but we prove that under the same hypotheses, G contains a subgraph H isomorphic to T that is "path-induced"; that is, for some distinguished vertex r, every path of H with one end r is an induced path of G.
更多
查看译文
关键词
Induced subgraphs,Chromatic number
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要