Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera T. Sós
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- award (1997): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j38]Svante Janson, Vera T. Sós:
More on quasi-random graphs, subgraph counts and graph limits. Eur. J. Comb. 46: 134-160 (2015)- 2013
- [j37]Daniel J. Kleitman, Aditya Shastri, Vera T. Sós:
Editorial. Discret. Appl. Math. 161(9): 1169 (2013) - [j36]László Lovász, Attila Sali, Vera T. Sós:
Preface. Electron. Notes Discret. Math. 43: 1-3 (2013) - 2011
- [j35]Christian Borgs
, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi:
Limits of randomly grown graph sequences. Eur. J. Comb. 32(7): 985-999 (2011) - 2009
- [j34]József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós:
The unlabelled speed of a hereditary graph property. J. Comb. Theory, Ser. B 99(1): 9-19 (2009) - 2008
- [j33]Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós:
A two-parameter family of an extension of Beatty sequences. Discret. Math. 308(20): 4578-4588 (2008) - [j32]László Lovász, Vera T. Sós:
Generalized quasirandom graphs. J. Comb. Theory, Ser. B 98(1): 146-163 (2008) - 2006
- [j31]Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán:
On some applications of graph theory, I. Discret. Math. 306(10-11): 853-866 (2006) - [j30]Dhruv Mubayi, Vera T. Sós:
Explicit constructions of triple systems for Ramsey-Turán problems. J. Graph Theory 52(3): 211-216 (2006) - 2005
- [j29]Gábor Elek, Vera T. Sós:
Paradoxical Decompositions and Growth Conditions. Comb. Probab. Comput. 14(1-2): 81-105 (2005) - [j28]Miklós Simonovits, Vera T. Sós:
A hierarchy of randomness for graphs. Discret. Math. 303(1-3): 209-233 (2005) - 2003
- [j27]Miklós Simonovits, Vera T. Sós:
Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. Comb. Probab. Comput. 12(3): 319-344 (2003) - [j26]Miklós Simonovits, Vera T. Sós:
Different levels of randomness in Random Ramsey theorems. Electron. Notes Discret. Math. 15: 189-192 (2003) - 2001
- [j25]Miklós Simonovits, Vera T. Sós:
Ramsey-Turán theory. Discret. Math. 229(1-3): 293-340 (2001) - 1999
- [j24]Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós:
Induced subgraphs of given sizes. Discret. Math. 200(1-3): 61-77 (1999) - 1997
- [j23]Miklós Simonovits, Vera T. Sós:
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. Comb. 17(4): 577-596 (1997) - 1995
- [j22]Paul Erdös, András Sárközy, Vera T. Sós:
On product representations of powers, I. Eur. J. Comb. 16(6): 567-588 (1995) - 1994
- [j21]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. Comb. Probab. Comput. 3: 297-325 (1994) - [j20]Paul Erdös, András Sárközy, Vera T. Sós:
On additive properties of general sequences. Discret. Math. 136(1-3): 75-99 (1994) - 1993
- [j19]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. 13(1): 31-56 (1993) - 1991
- [j18]Miklós Simonovits, Vera T. Sós:
Szemerédi's Partition and Quasirandomness. Random Struct. Algorithms 2(1): 1-10 (1991) - 1989
- [j17]Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós:
Maximal antiramsey graphs and the strong chromatic number. J. Graph Theory 13(3): 263-282 (1989) - 1988
- [j16]Richard H. Schelp, Miklós Simonovits, Vera T. Sós:
Intersection Theorems for t-Valued Functions. Eur. J. Comb. 9(6): 531-536 (1988) - 1986
- [j15]Ralph J. Faudree, Richard H. Schelp, Vera T. Sós:
Some intersection theorems on two valued functions. Comb. 6(4): 327-333 (1986) - [j14]Paul Erdös, Michael E. Saks, Vera T. Sós:
Maximum induced trees in graphs. J. Comb. Theory, Ser. B 41(1): 61-79 (1986) - 1985
- [j13]László Babai, Vera T. Sós:
Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs. Eur. J. Comb. 6(2): 101-114 (1985) - [j12]Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson:
On 2-Designs. J. Comb. Theory, Ser. A 38(2): 131-142 (1985) - 1984
- [j11]Miklós Simonovits, Vera T. Sós:
On restricted colourings of Kn. Comb. 4(1): 101-110 (1984) - 1983
- [j10]Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi:
More results on Ramsey - Turán Type problems. Comb. 3(1): 69-81 (1983) - [j9]Nathan Linial, Michael E. Saks, Vera T. Sós:
Largest digraphs contained in all n-tournaments. Comb. 3(1): 101-104 (1983) - [j8]Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson:
Finite linear spaces and projective planes. Discret. Math. 47: 49-62 (1983) - [j7]András Hajnal, Vera T. Sós:
Paul Erdös is seventy. J. Graph Theory 7(4): 391-393 (1983) - 1982
- [j6]Paul Erdös, Vera T. Sós:
On Ramsey - Turán type theorems for hypergraphs. Comb. 2(3): 289-295 (1982) - [j5]Vera T. Sós, Ernst G. Straus:
Extremals of functions on graphs with applications to graphs and hypergraphs. J. Comb. Theory, Ser. B 32(3): 246-257 (1982) - 1981
- [j4]Miklós Simonovits, Vera T. Sós:
Intersection Properties of Subsets of Integers. Eur. J. Comb. 2(4): 363-372 (1981) - 1980
- [j3]Ronald L. Graham, Miklós Simonovits, Vera T. Sós:
A Note on the Intersection Properties of Subsets of Integers. J. Comb. Theory, Ser. A 28(1): 106-110 (1980) - 1974
- [j2]B. Andrásfai, Paul Erdös, Vera T. Sós:
On the connection between chromatic number, maximal clique and minimal degree of a graph. Discret. Math. 8(3): 205-218 (1974) - 1972
- [j1]Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán:
On some applications of graph theory, I. Discret. Math. 2(3): 207-228 (1972)
Conference and Workshop Papers
- 2006
- [c1]Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi:
Graph limits and parameter testing. STOC 2006: 261-270
Parts in Books or Collections
- 2013
- [p1]András Sárközy, Vera T. Sós:
On Additive Representative Functions. The Mathematics of Paul Erdős I 2013: 233-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
