Vera T. Sós - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2015

More on quasi-random graphs, subgraph counts and graph limitsSvante Janson, Vera T. Sós. ejc, 46:134-160, 2015. [doi]

2013

EditorialDaniel J. Kleitman, Aditya Shastri, Vera T. Sós. DAM, 161(9):1169, 2013. [doi]

PrefaceLászló Lovász, Attila Sali, Vera T. Sós. endm, 43:1-3, 2013. [doi]

On Additive Representative FunctionsAndrás Sárközy, Vera T. Sós. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 233-262, Springer, 2013. [doi]

2011

Limits of randomly grown graph sequencesChristian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi. ejc, 32(7):985-999, 2011. [doi]

2009

The unlabelled speed of a hereditary graph propertyJózsef Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós. JCT, 99(1):9-19, 2009. [doi]

2008

A two-parameter family of an extension of Beatty sequencesShiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós. DM, 308(20):4578-4588, 2008. [doi]

Generalized quasirandom graphsLászló Lovász, Vera T. Sós. JCT, 98(1):146-163, 2008. [doi]

2006

Graph limits and parameter testingChristian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi. stoc 2006: 261-270 [doi]

On some applications of graph theory, IPaul Erdös, A. Meir, Vera T. Sós, P. Turán. DM, 306(10-11):853-866, 2006. [doi]

Explicit constructions of triple systems for Ramsey-Turán problemsDhruv Mubayi, Vera T. Sós. jgt, 52(3):211-216, 2006. [doi]

2005

Paradoxical Decompositions and Growth ConditionsGábor Elek, Vera T. Sós. cpc, 14(1-2):81-105, 2005. [doi]

A hierarchy of randomness for graphsMiklós Simonovits, Vera T. Sós. DM, 303(1-3):209-233, 2005. [doi]

2003

Different levels of randomness in Random Ramsey theoremsMiklós Simonovits, Vera T. Sós. endm, 15:189-192, 2003. [doi]

Hereditary Extended Properties, Quasi-Random Graphs And Induced SubgraphsMiklós Simonovits, Vera T. Sós. cpc, 12(3):319-344, 2003.

2001

Ramsey-Turán theoryMiklós Simonovits, Vera T. Sós. DM, 229(1-3):293-340, 2001. [doi]

1999

Induced subgraphs of given sizesPaul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós. DM, 200(1-3):61-77, 1999. [doi]

1997

Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced SubgraphsMiklós Simonovits, Vera T. Sós. combinatorica, 17(4):577-596, 1997.

1995

On product representations of powers, IPaul Erdös, András Sárközy, Vera T. Sós. ejc, 16(6):567-588, 1995. [doi]

1994

Turán-Ramsey Theorems and K:::p:::-Independence NumbersPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. cpc, 3:297-325, 1994.

On additive properties of general sequencesPaul Erdös, András Sárközy, Vera T. Sós. DM, 136(1-3):75-99, 1994. [doi]

1993

Turán-Ramsey theorems and simple asymptotically extremal structuresPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. combinatorica, 13(1):31-56, 1993.

1991

Szemerédi s Partition and QuasirandomnessMiklós Simonovits, Vera T. Sós. rsa, 2(1):1-10, 1991.

1989

Maximal antiramsey graphs and the strong chromatic numberStefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós. jgt, 13(3):263-282, 1989. [doi]

1988

Intersection Theorems for t-Valued FunctionsRichard H. Schelp, Miklós Simonovits, Vera T. Sós. ejc, 9(6):531-536, 1988. [doi]

1986

Maximum induced trees in graphsPaul Erdös, Michael E. Saks, Vera T. Sós. JCT, 41(1):61-79, 1986. [doi]

Some intersection theorems on two valued functionsRalph J. Faudree, Richard H. Schelp, Vera T. Sós. combinatorica, 6(4):327-333, 1986.

1985

Sidon Sets in Groups and Induced Subgraphs of Cayley GraphsLászló Babai, Vera T. Sós. ejc, 6(2):101-114, 1985. [doi]

On 2-DesignsPaul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson. JCT, 38(2):131-142, 1985.

1984

On restricted colourings of K::n::Miklós Simonovits, Vera T. Sós. combinatorica, 4(1):101-110, 1984.

1983

More results on Ramsey - Turán Type problemsPaul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi. combinatorica, 3(1):69-81, 1983.

Finite linear spaces and projective planesPaul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson. DM, 47:49-62, 1983. [doi]

Paul Erdös is seventyAndrás Hajnal, Vera T. Sós. jgt, 7(4):391-393, 1983. [doi]

Largest digraphs contained in all n-tournamentsNathan Linial, Michael E. Saks, Vera T. Sós. combinatorica, 3(1):101-104, 1983.

1982

On Ramsey - Turán type theorems for hypergraphsPaul Erdös, Vera T. Sós. combinatorica, 2(3):289-295, 1982.

Extremals of functions on graphs with applications to graphs and hypergraphsVera T. Sós, Ernst G. Straus. JCT, 32(3):246-257, 1982. [doi]

1981

Intersection Properties of Subsets of IntegersMiklós Simonovits, Vera T. Sós. ejc, 2(4):363-372, 1981. [doi]

1980

A Note on the Intersection Properties of Subsets of IntegersR. L. Graham, Miklós Simonovits, Vera T. Sós. JCT, 28(1):106-110, 1980.

1974

On the connection between chromatic number, maximal clique and minimal degree of a graphB. Andrásfai, Paul Erdös, Vera T. Sós. DM, 8(3):205-218, 1974. [doi]

1972

On some applications of graph theory, IPaul Erdös, Amram Meir, Vera T. Sós, Paul Turán. DM, 2(3):207-228, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL