Abstract
Define f(k, l) as the least integer so t h a t every graph having f(k, l) vertices contains either a complete graph of order k or a set of l independent vertices (a complete graph of order k is a graph of k vertices every two of which are connected by an edge, a set of I vertices is called independent if no two are connected by an edge).Throughout this paper c1, c2, … will denote positive absolute constants. It is known (1, 2) that(1)and in a previous paper (3) I stated that I can prove that for every ∈ > 0 and l > l(∈), f (3, l) > l2-∈. In the present paper I am going to prove that(2)
Publisher
Canadian Mathematical Society
Cited by
139 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A note on Reed's conjecture for triangle-free graphs;Discrete Mathematics;2023-12
2. Note on down‐set thresholds;Random Structures & Algorithms;2023-11-22
3. Ramsey Chains in Linear Forests;Axioms;2023-10-29
4. Bounds on Ramsey games via alterations;Journal of Graph Theory;2023-05-08
5. Down‐set thresholds;Random Structures & Algorithms;2023-04-12