Graphs without large triangle free subgr
β
B. BollobΓ‘s; H.R. Hind
π
Article
π
1991
π
Elsevier Science
π
English
β 751 KB
Bollobas, B. and H.R. Hind, Graphs without large triangle free subgraphs, Discrete Mathematics 87 (1991) 119-131. The main aim of the paper is to show that for 2 < r <s and large enough n, there are graphs of order n and clique number less than s in which every set of vertices, which is not too sma