Nothing Special   »   [go: up one dir, main page]

Rényi Alfréd Matematikai Kutatóintézet

HUN-REN logo

T. Sós Vera cikkei

Keresés az oldalon:

1952:

  • 1952-1  V. Sós: Pontra és irányra nézve konvex görbe és felület; Comptes Rendus du Premier Congrés des Mathématiciens Hongrois, 27 Aoüt-2 Septembre 1950, pp. 649-652.; Akadémiai Kiadó, Budapest, 1952.

1954:

  • 1954-1  T. Kővári, V.T Sós, P. Turán: On a problem of K. Zarankiewicz. Colloquium Math. 3, (1954) 50-57.

1955:

  • 1955-1  V.T Sós, P. Turán: On some new theorems in the theory of diophantine approximations. Acta Math. Acad. Sci. Hungar. 6 (1955), 241-255.

1957:

  • 1957-1  V.T Sós: A lánctörtek egy geometriai interpretációja és alkalmazásai. Mat. Lapok 8 1957 248-263.
  • 1957-2  V.T Sós: On the distribution Mod 1 of sequence n alpha.  Anneles Univ.Sci. Budapest, R.Eétvés Sec. Math.(1958) p.127-134.
  • 1957-3 V.T Sós: On the theory of Diophantine approximations I.  Acta Math. Acad. Sci. Hungar 8 1957 461-472.

1958:

  • 1958-1  V.T Sós: On the theory of Diophantine approximations II. Inhomogeneous problems. Acta Math. Acad. Sci. Hungar 9 1958 , 229-241

1960:

  • 1960-1 V.T Sós: On a Problem of S. Hartman about normal forms; Colloquium Mathematicum, Vol VII (1959/1960) 155-160.

1961:

  • 1961-1  V.T Sós: On a problem in the theory of simultaneous approximation. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 3-4 (1960/1961) 291-294.

1964:

  • 1964-1 HANANI, H.; ORNSTEIN, D.; V.T Sós.: On the lottery problem. Magyar Tud. Akad. Mat. Kutató Int. Közl. 9 (1964) 155-158.

1966:

  • 1966-1 ERDŐS, P.; RÉNYI, A.; V.T Sós: On a problem of graph theory. Studia Sci. Math. Hungar.  (1966) 215-235.
  • 1966-2 KESTEN, H.; V.T Sós: On two problems of Erdős, Szüsz and Turán concerning Diophantine approximations. Acta Arithmetica XII. (1966/1967) 183-192.

1969:

  • 1969-1  A. HAJNAL, V.T Sós: On a problem for biparte graphs. (1969)

1970:

  • 1970-1 ERDŐS, P.; V.T Sós: Some remarks on Ramsey’s and Turán’s theorem. Combinatorial theory and its applications, II (Proc. Collog., Balatonfüred, (1969), pp. 395-404. North-Holland, Amsterdam, (1970)

1971:

  • 1971-1  ERDŐS, P.; MEIR, A.; V.T Sós; TURÁN, P.: On some applications of graph theory. II. (1971) Studies in Pure Mathematics (Presented to Richard Rado pp. 89-99 Academic Press, London

1972:

  • 1972-1  ERDŐS, P.; MEIR, A.; V.T Sós, P. TURÁN: On some applications of graph theory. III. Canad. Math. Bull. 15 (1972), 27-32.

1973:

  • 1973-1 V.T Sós; ERDŐS, P.: Brown, W.G.: On the existence of triangulated spheres in 3-graphs and related problems. Periodica Math. Hungar. 3 (1973) no.3-4, 221-228
  • 1973-2  Brown, W.G., Erdős,P., V.T Sós.: Some extremal problems on r- graphs. (New directions in the theory of of graphs (Proc. Third Ann Arbor Conf. Univ. Michigan (1971) Academic Press New York, (1973) 53-63.
  • 1973-3 ERDŐS, P.; SIMONOVITS, M.; V.T Sós.: Anti-Ramsey theorems. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. II, pp. 633-643. Collog. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam, (1975).
  • 1973-4 Sós, V. T.: Remarks on the connection of graph theory, finite geometry and block designs. Colloquio Internazionale sulle Teorie Combinatorie (Roma, 1973), Tomo II, pp. 223-233. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, (1976.)

1974:

  • 1974-1  ANDRÁSFAI, B.; ERDŐS, P.; Sós, V. T.: On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math. 8 (1974) , 205-218.
  • Problems 
  • 1974-2  Sós, V. T.: On the discrepancy of the sequence {nα}. Topics in number theory (Proc. Collog., Debrecen, 1974), pp. 359-367. Collog. Math. Soc. János Bolyai, Vol. 13, North-Holland, Amsterdam, (1976).

1975:

  • 1975-1 FRIED, E.; Sós, V. T.: Weakly associative lattices and projective planes. Algebra Universalis 5 (1975), 114-119.

1976:

  • 1976-1 SIMONOVITS, M; Sós, V. T.: Intersection theorems for graphs. Problémes combinatoires et théorie des graphes (Collog. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 389-391, Collog. Internat. CNRS, 260, CNRS, Paris, (1978).

1978:

  • 1978-1 SIMONOVITS, M; Sós, V. T.: Intersection theorems for graphs II. Problémes combinatoires et théorie des graphes (Collog. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 389-391, Collog. Internat. CNRS, 260, CNRS, Paris, (1978).

1979:

  • 1979-1 ERDŐS, P.; Sós, V. T.: On Turán-Ramsey type theorems. II. Studia Sci. Math. Hungar. 14 (1979), no. 1-3, 27-36 (1982).
  • 1979-2 ERDŐS, P.; Sós, V. T.: Problems and results on Ramsey-Turán type theorems (preliminary report). Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), pp. 17-23, Congress. Numer., XXVI, Utilitas Math., Winnipeg, Man., (1980).
  • 1979-3 Sós, V. T.; ZAREMBA, S. K.: The mean-square discrepancies of some two-dimensional lattices. Studia Sci. Math. Hungar. 14 (1979), no. 1-3, 255-271 (1982).

1980:

  • 1980-1  GRAHAM, R. L.; SIMONOVITS, M.; Sós, V. T.: A note on the intersection properties of subsets of integers. J. Combin. Theory Ser. A 28 (1980), no. 1, 106-110.
  • 1980-2 SIMONOVITS, M; Sós, V. T.: Intersection theorems on structures. Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. And Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978). Ann. Discrete Math. 6 (1980), 301-318.
  • 1980-3 DUPAIN, Y.; Sós, V. T.: On the one-sided boundedness of discrepancy-function of the sequence {nα}. Acta Arith. 37 (1980), 363-374.

1981:

  • 1981-1 SIMONOVITS, M.; Sós, V. T.: Intersection properties of subsets of integers. European J. Combin. 2 (1981), no. 4, 363-879.
  • 1981-2  DUPAIN, I.; Sós, V. T.: On the discrepancy of (nα) seguences. Collog. Math. Soc. János Bolyai, 34. Topics in classical number theory, Vol. I, II (Budapest, 1981), 355-387.;  North-Holland, Amsterdam, (1984.)
  • 1981-3 SAKS, M.; Sós, V.T.: On unavoidable subgraphs of tournaments. Collog. Math. Soc. János Bolyai, 37.Finite and infinite sets, Vol. I, II (Eger, 1981), 663-674, , North-Holland, Amsterdam, (1984.)

1982:

  • 1982-1 Sós, V. T.; STRAUS, E. G.: Extremals of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory Ser. B 32 (1982), no. 3, 246-257.
  • 1982-2  ERDŐS, P.; MULLIN, R. C.; Sós, V. T.; STINSON, D. R.: Finite linear spaces and projective planes. Discrete Math. 47 (1983), no. 1, 49-62.
  • 1982-3  ERDŐS, P.; Sós, V. T.: On Ramsey-Turán type theorems for hypergraphs. Combinatorica 2 (1982), no. 3, 289-295.

1983:

  • 1983-1  Sós, V. T.: Irregularities of partitions: Ramsey theory, uniform distribution. Surveys in combinatorics (Southampton, 1983), 201-246, London Math. Soc. Lecture Note Ser., 82, Cambridge Univ. Press, Cambridge, (1989.)
  • 1983-2 LINIAL, N.; SAKS, M.; Sós, V. T.: Largest digraphs contained in all n-tournaments. Combinatorica 3 (1983), no. 1, 101-104.
  • 1983-3 ERDŐS, P.; HAJNAL, A.; SÓS, V. T.; SZEMERÉDI, E.: More results on Ramsey-Turán type problems. Combinatorica 3 (1983), no. 1, 69-81.
  • 1983-4 ERDŐS, P.; Sós, V. T.: On a generalization of Turán’s graph-theorem. Studies in pure mathematics, 181-185, Birkhauser, Basel, (1983.)
  • 1983-5 Sós, V. T.: On strong irregularities of the distribution of {nα} sequences. Studies in pure mathematics, 685-700, Birkhdéuser, Basel, (1983.)
  • 1983-6 WEI, W.K., F.K.HWANG, Sós V.T.: Optimal sequencing of items in a consecutive 2-out-of -n system, IEEE , Reliability 32 (1983) 30-34.
  • 1983-7 HAJNAL, A.; Sós, V. T.: Paul Erdős is seventy. J. Graph Theory 7 (1983), no. 4, 391-393.

1984:

  • 1984-1 SIMONOVITS, M.; Sós, V. T.: On restricted colourings of Kn. Combinatorica 4 (1984), no. 1, 101-110.

1985:

  • 1985-1 ERDŐS, P.; FOWLER, J. C.; Sós, V.T.; WILSON, R. M.: On 2-designs.
    Journal of Combinatorial Theory Ser. A 38 (1985), no. 2, 131-142.
  • 1985-2 ERDŐS, P.; SÁRKÖZY, A.; Sós, V. T.: Problems and results on additive properties of general sequences. IV. Number theory (Ootacamund, 1984), 85- 104 , Lecture Notes in Math., 1122, Springer, Berlin, 1985.
  • 1985-3 BABAI, L.; Sós, V. T.: Sidon sets in groups and induced subgraphs of Cayley graphs. European J. Combin. 6 (1985), no. 2, 101-114.

1986:

  • 1986-1 ERDŐS, P.; SAKS, M.; Sós, V. T.: Maximum induced trees in graphs. Journal of Combinatorial Theory Ser. B 41 (1986), no. 1, 61-79.
  • 1986-2 ERDŐS, P.; SÁRKÖZY, A.; Sós, V. T.: Problems and results on additive properties of general sequences. V. Monatsh. Math. 102 (1986), no. 8, 183-197.
  • 1986-3 ERDŐS, P.; Sós, V. T.: Problems and results on intersections of set systems of structural type. Utilitas Math. 29 (1986), 61-70.
  • 1986-4 FAUDREE, R. J.; SCHELP, R. H.; Sós, V. T.: Some intersection theorems on two-valued functions. Combinatorica 6 (1986), no. 4, 327- 333.

1987:

  • 1987-1 HWAN, F. K.; Sós, V. T.: Non-adaptive hypergeometric group testing. Studia Sci. Math. Hungar. 22 (1987), no. 1-4, 257-268.
  • 1987-2 ERDŐS, P.; SÁRKÖZY, A.; Sós, V. T.: Problems and results on additive properties of general sequences III. Studia Sci.Math.Hung. 22 (1987), no. 1-4, 53-63.

1988:

  • 1988-1 BURR, S. A.; ERDÖS, P.; Sós, V. T.; FRANKL, P.; GRAHAM, R. L.: Further results on maximal anti-Ramsey graphs. Graph theory, combinatorics, and applications, Vol. 1 (Kalamazoo, MI, 1988), 193-206, WileyIntersci. Publ., Wiley, New York, (1991)
  • 1988-2 SCHELP R.A.; SIMONOVITS, M.; Sós, V. T.: Intersection theorems for t-valued functions. European J. Combin. 9 (1988), no. 6, 591-596
  • 1988-3 SZEKERES, G.; Sós, V.T.: Rational approximation vectors. Acta Arith. 49 (1988), no. 3, 255-261.

1989:

  • 1989-1 BURR, S. A.; ERDÖS, P; GRAHAM, R. L.; Sós, V. T.: Maximal antiRamsey graphs and the strong chromatic number. Journal of Graph Theory 13 (1989), no. 3, 263-282.
  • 1989-2 ERDŐS, P.; SÁRKÖZY, A.; Sós, V. T.: On a conjecture of Roth and some related problems. I. Irregularities of partitions (Fertőd, 1986), 47-59, Algorithms Combin. Study Res. Texts, 8, Springer, Berlin, (1989.)

1991:

  • 1991-1 Sós, V. T.: An additive problem in different structures. Graph theory, combinatorics, algorithms, and applications (San Francisco, CA, 1989), 486-510, SIAM, Philadelphia, PA, 1991.
  • 1991-2 SIMONOVITS, M.; SÓS, V. T.: Szemerédi’s partition and quasirandomness. Random Structures Algorithms 2 (1991), no. 1, 1-10.

1992:

  • 1992-1 ERDŐS, P.; SIMONOVITS, M.; Sós, V. T.; RAO, S. B.: On totally supercompact graphs. Combinatorial mathematics and applications (Calcutta, 1988). Sankhya Ser. A 54 (1992), 154-167.
  • 1992-2 ERDŐS, P.; Sós, V. T.; FAUDREE, R. J.: The k-spectrum of a graph. Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 377-389, Wiley-Intersci. Publ., Wiley, New York, (1995.)
  • 1992-3 BABAI, L.; Sós, V. T.: Tibor Gallai, 1912-1992. Combinatorica 12 (1992), no. 4, 871-372.

1993:

  • 1993-1 ERDŐS, P.; SÁRKÖZY, A.; Sds, V. T.: On additive properties of general sequences. Trends in discrete mathematics. Discrete Math. 136 (1994), no. 1-8, 75-99.
  • 1993-2 ERDŐS, P.; HAJNAL, A.; SIMONOVITS, M.; Sós, V. T.; SZEMERÉDI, E.: Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13 (1993), no. 1, 31-56.

1994:

  • 1994-1 ERDŐS, P.; SÁRKÖZY, A.; Sós, V.T.: On sum sets of Sidon sets. I. J. Number Theory 47 (1994), no. 3, 329-347.
  • 1994-2 ERDŐS, P.; HAJNAL, A.; SIMONOVITS, M.; Sós, V. T.; SZEMERÉDI, E.: Turán-Ramsey theorems and Kp-independence numbers. Combin. Probab. and Comput. 3 (1994), no. 3, 297-325.

1995:

  • 1995-1 DEUBER, W.A.: SIMONOVITS, M ,: Sós,V.T.: A note on paradoxical metric spaces. Studia Sci.Math.Hungar. 30 (1995),no. 1-2, 17-23
  • 1995-2 ERDŐS, P.; FÜREDI, Z.; LOEBL, M.; Sós, V. T.: Discrepancy of trees. Studia Sci. Math. Hungar. 30 (1995), no. 1-2, 47-57
  • 1995-3 BECK, J.; Sós, V. T.: Discrepancy theory.  Handbook of combinatorics, Vol. 1, 2, 1405-1446, Elsevier, Amsterdam, (1995.)
  • 1995-4 ERDŐS, P.; SÁRKÖZY, A.; Sós, V. T.: On product representations of powers. I. European J. Combin. 16 (1995), no. 6, 567-588.
  • 1995-5 ERDŐS, P.; SÁRKÖZY, A.; Sós, V.T.: On sum sets of Sidon sets. II. Israel J. Math. 90 (1995), no. 1-3, 221-233.

1997:

  • 1997-1 SIMONOVITS, M.; Sós, V. T.: PAUL ERDŐS: the man and the mathematician (1913-1996). (Hungarian) Mat. Lapok (N.S.) 7 (1997), no. 3-4, 4-32 (2003).
  • 1997-2 SIMONOVITS, M.; Sós, V. T.: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs. Combinatorica 17 (1997), no. 4, 577-596
  • 1997-3 SÁRKÖZY, A.; Sós, V. T.: On additive representation functions. The mathematics of Paul Erdős, I, 129-150, Algorithms Combin., 13, Springer, Berlin, (1997.)
  • 1997-4 Sós, V. T.: Paul Erdős, 1913-1996. Aequationes Math. 54 (1997), no. 8, 205-220.

1999:

  • 1999-1 ERDŐS, P.; FÜREDI, Z.; ROTHSCHILD, B. L.; Sós, V. T.: Induced subgraphs of given sizes. Paul Erdős memorial collection. Discrete Math. 200 (1999), 61-77.
  • 1999-2 DESHOUILLERS, JEAN-MARC; FREIMAN, GREGORY A.; SOS, VERA; TEMKIN, MIKHAIL: On the structure of sum-free sets. II. Structure theory of set addition. Astérisque No. 258 (1999), xii, 149-161.

2001:

  • 2001-1 BÍRÓ, A.; DESHOUILLERS, J.-M.; Sós, V. T.: Good approximation and characterization of subgroups of R/Z. Studia Sci. Math. Hungar. 38 (2001), 97-113.
  • 2001-2 SIMONOVITS, M.; Sós, V. T.: Ramsey-Turán theory. Combinatorics, graph theory, algorithms and applications. Discrete Math. 229 (2001), no. 1-8, 298-340.

2002:

  • 2002-1 Sós, V. T.: Turbulent years: Erdős in his correspondence with Turán from 1934 to 1940. Paul Erdős and his mathematics, I (Budapest, 1999), 85-146, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, (2002), 85-146.

2003:

  • 2003-1 SIMONOVITS, M.; Sós, V. T.: Different levels of randomness in random Ramsey theorems. Electronic Notes in Discrete Mathematics. Vol. 15, 191-194 (electronic), Elsevier, Amsterdam, (2003)
  • 2003-2 SIMONOVITS, M.; Sós, V. T.: Foreword: Paul Erdős: the man and the mathematician (1913-1996). Recent trends in combinatorics (Matraháza, 1995), iz-xx, Cambridge Univ. Press, Cambridge, (2001)
  • 2003-3 SIMONOVITS, M.; Sós, V. T.: Hereditary extended properties, quasi-random graphs and induced subgraphs. Combinatorics, probability and computing (Oberwolfach, 2001). Combin. Probab. Comput. 12 (2003), no. 8, 319-344
  • 2003-4 BÍRÓ, A.; Sós, V. T.: Strong characterizing sequences in simultaneous approximation. J. Number Theory 99 (2003), no. 2, 405-414.

2005:

  • 2005-1 SIMONOVITS, M.; Sós, V. T.: A hierarchy of randomness for graphs. Discrete Math. 303 (2005), no. 1-8, 209-233
  • 2005-2 MUBAYI, DHRUV; Sós, V. T.: Explicit constructions of triple systems for Ramsey-Turán problems. J. Graph Theory 52 {2006), no. 3, 211-216.
  • 2005-3 LOVÁSZ, L.; Sós, V. T.: Generalized quasirandom graphs. J. Combin. Theory Ser. B 98 {2008), no. 1, 146-163.
  • 2005-4 CHEN, YONG-GAO; SÁRKÖZY, A.; Sós, V.T.; TANG, MIN: On the monotonicity properties of additive representation functions. Bull. Austral. Math. Soc. 72 (2005), no. 1, 129-188.
  • 2005-5 ELEK, G.; Sós, V.T.: Paradoxical decompositions and growth conditions. Combin. Probab. Comput. 14 (2005), no. 1-2,
  • 2005-6 Sós, V.T.: Paradoxical decompositions and growth properties, Oberwolfach Report 1/2004. 85-87.

2006:

  • 2006-1 BORGS, C.; CHAYES, J.; LOVÁSZ, L.; Sós, V. T.: VESZTERGOMBI, K.: Counting graph homomorphisms. Topics in discrete mathematics, 315-371, Algorithms Combin., 26, Springer, Berlin, (2006)
  • 2006-2 LOVÁSZ, L.; Sós, V. T.: Generalized quasirandom graphs. J. Combin. Theory Ser. B 98 {2008), no. 1, 146-163.
  • 2006-3 BORGS, C.; CHAYES, J.; LOVÁSZ, LÁSZLÓ; Sós, V. T.:; SZEGEDY, B.; VESZTERG0MBI, K.: Graph limits and parameter testing. STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 261-270, ACM, New York, (2006.)
  • 2006-4 ERDŐS, P.; MEIR, A:; Sós, V. T.; TURÁN, P.: On some applications of graph theory I.  Discrete Math. 6. (2006) 853-866.

2007:

  • 2007-1 ARTSTEIN-AVIDAN, SHIRI; FRAENKEL, A; S.; Sós, V. T.: A two-parameter family of an extension of Beatty sequences. Discrete Math. 308 (2008), no. 20, 4578-4588.
  • 2007-2 BORGS, C.; CHAYES, J. T.; LOVÁSZ, L.; Sós, V. T.; VESZTERGOMBI, K.: Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 {2012), no. 1, 151-219.
  • 2007-3 LACZKOVITCH, M.; Sós, V.T.: Emlékezés Klein Eszterre és Szekeres Györgyre, Emlékbeszédek 2002-2005, MTA, Bp (2006)
  • 2007-4 MUBAYI, DHRUV; Sós, V. T.: Explicit constructions of triple systems for Ramsey-Turán problems. J. Graph Theory 52 {2006), no. 3, 211-216.

2008:

  • 2008-1 ARTSTEIN-AVIDAN, SHIRI; FRAENKEL, A.S.; Sós, V. T.: A two-parameter family of an extension of Beatty sequences. Discrete Math. 308 (2008), no. 20, 4578-4588.
  • 2008-2 BORGS, C.; CHAYES, J. T.; LOVÁSZ, L.; Sós, V. T.; VESZTERGOMBI, K.: Convergent sequences of dense graphs. I. Subgraph frequencies , metric properties and testing. Adv. Math. 219 {2008), no. 6, 1801-1851.

2009:

  • 2009-1 BALOGH, J.; BOLLOBÁS, B.; SAKS, M.; Sós v.T.: The unlabelled speed of a hereditary graph property. J. Combin. Theory Ser. B 99 {2009), no. 1, 9-19.

2011:

  • 2011-1 BORGS, C.; CHAYES, J. T.; LOVÁSZ, L.; Sós, V. T.; VESZTERGOMBI, K.: Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 {2012), no. 1, 151-219.
  • 2001-2  BORGS, C; CHAYES, J.; LOVÁSZ, L.; Sós, V.; VESZTERGOMBI, K.: Limits of randomly grown graph sequences. European J. Combin. 32 {2011), no. 7, 985-999.

2013:

  • 2013-1 SÁRKÖZY, A.; Sós, V. T.: On additive representation functions (with Appendix), ln The Mathematics of Paul Erdös, eds. Graham, R.L. et al., 2nd extended edition , Springer, New York, 2013 , pp.295-307.

2015:

  • 2015-1 JANSON, SVANTE; Sós, V. T. : More on quasi-random graphs, subgraph counts and graph limits, European J. of Combin. 46, (2015), 134-146.