Dear friends of combinatorics and good mathematics!
Prof. L. Lovasz will deliver the
	Annual Distinguished CS Lecture on April 30, May 1 and 2.
His new book Large Networks and Graph Limits just has been published as
volume 60 of the AMS Colloquium Lectures.
Just in case you haven't been in the North lately, this might give you an
Hope to see some of you.
Janos Makowsky
Professor Laszlo Lovasz from Eotvos Lorand University in Budapest,
Hungary will be a distinguished guest of the CS Department and will give
a series of talks as follows:
Lecture 1:
Large Networks, Graph Limits, And Why Are They Useful
Tuesday, April 30, 14:30-15:30, Taub Building 337
The lecture is for CS Faculty and students as well as general audience,
If you have a very large network (which may be deterministic or the
result of some random procedure), we may want to approximate it by a
smaller object, or by an infinite (analytic) object. The former question
is related to Szemer\'edi's Regularity Lemma and its variants, the
latter, to "graph limits". A theory of convergent graph sequences and
their limits has been worked out by Benjamini and Schramm (for graphs
with bounded degree) and by Borgs, Chayes, Lov\'asz, S\'os, Szegedy and
Vesztergombi (for dense graphs). Focusing on the dense case, I will
describe the motivation for graph limit theory and some basic facts.
Lecture 2:
Limits of Dense Graphs: Algorithms And Extremal Graph Theory
May 1, 13:30-14:30, Taub Building 337
The lecture is for mathematically minded audience
Applications of graph limit theory to algorithmic problems present novel
challenges; some of the classical algorithmic problems must be
rephrased, and a new kind of complexity theory emerges. Much of this has
been worked out in the theory of "Graph Property Testing" in computer
science, where we assume that information about such graphs is obtained
by an appropriate sampling procedure. Graph limits offer a new
perspective on this field, along with some new results.
Many questions in extremal graph theory can be phrased like this: what
is the maximum of a certain linear combination of densities of given
graphs in any graph G? Answers to such questions are often quite
difficult. Graph limits make it possible to pose and in some cases
answer some general questions about extremal graphs: Which inequalities
between subgraph densities are valid? Can all valid inequalities be
proved using just Cauchy-Schwarz? Is there always an extremal graph?
Which graphs are extremal?
Lecture 3:
Limits of Sparse Graphs: Distributed Algorithms And Group Theory
May 2, 14:30-15:30, Taub Building 337
The lecture is for mathematically minded audience
The limit theory of bounded-degree graphs is very interesting, but
substantially more challenging than the dense theory. Limit objects can
be defined in more than one sense; an interesting class of infinite
graphs, which are called graphings and have been known from group theory
and ergodic theory for a while, can be used to describe limit objects.
Algorithmic questions in this theory are closely related to distributed
computing in constant time.
László Lovász, born in 1948 in Budapest, is a Hungarian-American
best known for his work in combinatorics, combinatorial
graph theory and their impact on computer science, for
the Wolf Prize and the Knuth Prize in 1999, and
He received the Fulkerson Prize twice (1982,
Hungary's Széchenyi Grand Prize
(2008), Bolyai prize (2007),
Gödel Prize (2001).
Lovász received his Candidate
of Sciences degree in 1970 at
His advisor was Tibor Gallai. Until 1975, Lovász
between 1975-1982 he led the
Department of Geometry at the
University of Szeged.
In 1982 he returned to the Eötvös
University, where he created the
Department of Computer Science.
Lovász was a professor at Yale
and was a
collaborative member of the Microsoft Research Center until 2006. He
where he was the
He served as
between January 1,
2007 and December 31, 2010.
Youtube Interview: Avi Wigderson interviews László Lovász.
Haifa 32000, Israel
Tel/Fax: +972-4-8294358 (Office phone)
         +972-4-8221128 (Office FAX)
	 +972-4-8332952 (home: automatic answering and FAX)
	 +972-54-755 7616 (mobile Israel)
e-mail:  <>
Additional information available via WWW:
Preprints at
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <> 
Announcement from: Johann Makowsky   <>