Vera T. Sós

According to our database1, Vera T. Sós authored at least 40 papers between 1972 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
More on quasi-random graphs, subgraph counts and graph limits.
Eur. J. Comb., 2015

2013
Preface.
Electronic Notes in Discrete Mathematics, 2013

Editorial.
Discrete Applied Mathematics, 2013

On Additive Representative Functions.
Proceedings of the Mathematics of Paul Erdős I, 2013

2011
Limits of randomly grown graph sequences.
Eur. J. Comb., 2011

2009
The unlabelled speed of a hereditary graph property.
J. Comb. Theory, Ser. B, 2009

2008
Generalized quasirandom graphs.
J. Comb. Theory, Ser. B, 2008

A two-parameter family of an extension of Beatty sequences.
Discrete Mathematics, 2008

2006
Explicit constructions of triple systems for Ramsey-Turán problems.
Journal of Graph Theory, 2006

On some applications of graph theory, I.
Discrete Mathematics, 2006

Graph limits and parameter testing.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
A hierarchy of randomness for graphs.
Discrete Mathematics, 2005

Paradoxical Decompositions and Growth Conditions.
Combinatorics, Probability & Computing, 2005

2003
Different levels of randomness in Random Ramsey theorems.
Electronic Notes in Discrete Mathematics, 2003

Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs.
Combinatorics, Probability & Computing, 2003

2001
Ramsey-Turán theory.
Discrete Mathematics, 2001

1999
Induced subgraphs of given sizes.
Discrete Mathematics, 1999

1997
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs.
Combinatorica, 1997

1995
On product representations of powers, I.
Eur. J. Comb., 1995

1994
On additive properties of general sequences.
Discrete Mathematics, 1994

Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing, 1994

1993
Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica, 1993

1991
Szemerédi's Partition and Quasirandomness.
Random Struct. Algorithms, 1991

1989
Maximal antiramsey graphs and the strong chromatic number.
Journal of Graph Theory, 1989

1988
Intersection Theorems for t-Valued Functions.
Eur. J. Comb., 1988

1986
Maximum induced trees in graphs.
J. Comb. Theory, Ser. B, 1986

Some intersection theorems on two valued functions.
Combinatorica, 1986

1985
On 2-Designs.
J. Comb. Theory, Ser. A, 1985

Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs.
Eur. J. Comb., 1985

1984
On restricted colourings of Kn.
Combinatorica, 1984

1983
Paul Erdös is seventy.
Journal of Graph Theory, 1983

Finite linear spaces and projective planes.
Discrete Mathematics, 1983

Largest digraphs contained in all n-tournaments.
Combinatorica, 1983

More results on Ramsey - Turán Type problems.
Combinatorica, 1983

1982
Extremals of functions on graphs with applications to graphs and hypergraphs.
J. Comb. Theory, Ser. B, 1982

On Ramsey - Turán type theorems for hypergraphs.
Combinatorica, 1982

1981
Intersection Properties of Subsets of Integers.
Eur. J. Comb., 1981

1980
A Note on the Intersection Properties of Subsets of Integers.
J. Comb. Theory, Ser. A, 1980

1974
On the connection between chromatic number, maximal clique and minimal degree of a graph.
Discrete Mathematics, 1974

1972
On some applications of graph theory, I.
Discrete Mathematics, 1972


  Loading...