#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2001

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- László Lovász, Balázs Szegedy
- J. Comb. Theory, Ser. B
- 2006

We show that if a sequence of dense graphs Gn has the property that for every fixed graph F , the density of copies of F in Gn tends to a limit, then there is a natural " limit object " , namely a symmetric measurable function W : [0, 1] 2 → [0, 1]. This limit object determines all the limits of subgraph densities. Conversely, every such function arises as… (More)

- Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
- 46th Annual IEEE Symposium on Foundations of…
- 2005

The <i>exponent of matrix multiplication</i> is the smallest real number ω such that for all ε>0, <i>O</i>(n<sup>ω+ε</sup>) arithmetic operations suffice to multiply two <i>n×n</i> matrices. The standard algorithm for matrix multiplication shows that ω≤3. Strassen's remarkable result [5] shows that ω≤2.81,… (More)

Szemerédi's Regularity Lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph property testing, combinatorial number theory, etc. The goal of this paper is to point out that Szemerédi's Lemma can be thought of as a result in analysis. We show three different analytic interpretations.

Let A = {a 1 ,. .. , a k } and B = {b 1 ,. .. , b k } be two subsets of an Abelian group G, k ≤ |G|. Snevily conjectured that, when G is of odd order, there is a permutation π ∈ S k such that the sums a i + b π(i) , 1 ≤ i ≤ k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even when A is a sequence of k < |G|… (More)

- BALÁZS SZEGEDY
- 2007

- László Lovász, Balázs Szegedy
- Journal of Graph Theory
- 2009

We study generalizations of the " contraction-deletion " relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman, Lovász and Schrijver in [2], and it relates to their behavior under basic graph operations like contraction and… (More)

- László Lovász, Balázs Szegedy
- J. Comb. Theory, Ser. B
- 2011

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turán, Erd˝ os–Simonovits and Chung–Graham–Wilson, we… (More)

- Balázs Szegedy
- 2008

In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemerédi's Theorem on arithmetic progressions. If in an Abelian group A there are sets S 1 , S 2. .. , S t such that the number of… (More)

- László Lovász, Balázs Szegedy
- Journal of Graph Theory
- 2012

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency conditions, and normalized, multiplica-tive and reflection positive graph parameters. In this paper we show that each of these… (More)

We define a distance of two graphs that reflects the closeness of both local and global properties. We also define convergence of a sequence of graphs, and show that a graph sequence is convergent if and only if it is Cauchy in this distance. Every convergent graph sequence has a limit in the form of a symmetric measurable function in two variables. We use… (More)