Previous |  Up |  Next

Article

Title: On $k$-Thin Sets and $n$-Extensive Graphs (English)
Author: Znám, Štefan
Language: English
Journal: Matematický časopis
ISSN: 0025-5173
Volume: 17
Issue: 4
Year: 1967
Pages: 297-307
.
Category: math
.
MSC: 05.40
idZBL: Zbl 0173.01901
idMR: MR0232699
.
Date available: 2009-09-25T07:53:36Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/127008
.
Reference: [1] Abbott H. L., Moser L.: Sum-free sets of integers.Acta arithm. 11 (1966), 393-396. Zbl 0151.03701, MR 0200170
Reference: [2] Erdős P.: Some remarks on the theory of graphs.Bull. Amer. Math. Soc. 53 (1947), 292 - 299. MR 0019911
Reference: [3] Erdős P.: Graph theory and probability II..Canad. J. Math. 13 (1961), 346-352. MR 0120168
Reference: [4] Greenwood R. E., Gleasson A. M.: Combinatorical relations and chromatic graphs.Canad. J. Math. 7 (1955), 1-7. MR 0067467
Reference: [5] Rado R.: Studien zur Kombinatorik.Math. Z. 36 (1933), 424-480. Zbl 0006.14603, MR 1545354
Reference: [6] Schur I.: Űber die Kongruenz $x^m + y^m \equiv z^m (mod p)$.Jahresber. Dtsch. Math.-Ver. 25 (1916), 114-117.
Reference: [7] Znám Š.: Generalisation of a number theoretical result.Mat.-fyz. časop. 16 (1966) 357-361. MR 0209175
Reference: [8] Znám Š.: Megjegyzések Turán Pál egy publikálatlan eredményéhez.Mat. lapok 16 (1963), 307-310.
.

Files

Files Size Format View
MathSlov_17-1967-4_5.pdf 816.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo