On $k$-Thin Sets and $n$-Extensive Graphs

Previous | Up | Next

Article

On $k$-Thin Sets and $n$-Extensive Graphs. (English). Matematický časopis, vol. 17 (1967), issue 4, pp. 297-307

MSC: 05.40 | MR 0232699 | Zbl 0173.01901

References:

[1] Abbott H. L., Moser L.: Sum-free sets of integers. Acta arithm. 11 (1966), 393-396. MR 0200170 | Zbl 0151.03701

[2] Erdős P.: Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 53 (1947), 292 - 299. MR 0019911

[3] Erdős P.: Graph theory and probability II. Canad. J. Math. 13 (1961), 346-352. MR 0120168

[4] Greenwood R. E., Gleasson A. M.: Combinatorical relations and chromatic graphs. Canad. J. Math. 7 (1955), 1-7. MR 0067467

[5] Rado R.: Studien zur Kombinatorik. Math. Z. 36 (1933), 424-480. MR 1545354 | Zbl 0006.14603

[6] Schur I.: Űber die Kongruenz $x^m + y^m \equiv z^m (mod p)$. Jahresber. Dtsch. Math.-Ver. 25 (1916), 114-117.

[7] Znám Š.: Generalisation of a number theoretical result. Mat.-fyz. časop. 16 (1966) 357-361. MR 0209175

[8] Znám Š.: Megjegyzések Turán Pál egy publikálatlan eredményéhez. Mat. lapok 16 (1963), 307-310.

Partner of