共 50 条
On the Minimum Degree of Minimal Ramsey Graphs
被引:15
|作者:
Szabo, Tibor
[1
]
Zumstein, Philipp
[2
]
Zuercher, Stefanie
[2
]
机构:
[1] McGill Univ, Dept Math & Stat, Montreal, PQ, Canada
[2] ETH, Inst Theoret Comp Sci, Zurich, Switzerland
关键词:
Ramsey theory;
minimal Ramsey graphs;
minimum degree;
Ramsey-equivalent;
Ramsey-seperable;
D O I:
10.1002/jgt.20445
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr et al. We determine the corresponding graph parameter for numerous bipartite graphs, including bi-regular bipartite graphs and forests. We also make initial progress for graphs of larger chromatic number. Numerous interesting problems remain open. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 64: 150-164, 2010
引用
收藏
页码:150 / 164
页数:15
相关论文