Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Combinatorica. 22:445-449
Let be the Turan number which gives the maximum size of a graph of order containing no subgraph isomorphic to . In 1973, Erdős, Simonovits and Sos [5] proved the existence of an integer such that for every integer , the minimum number of colours , s
Publikováno v:
Combinatorica. 11:55-61
Lets andk be positive integers. We prove that ifG is ak-connected graph containing no independent set withks+2 vertices thenG has a spanning tree with maximum degree at mosts+1. Moreover ifs≥3 and the independence number α(G) is such that α(G)≤