Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CPC
2007

favoriteEmaildiscussreport

113views more CPC 2007»

Regular Partitions of Hypergraphs: Regularity Lemmas

13 years 4 months ago

Regular Partitions of Hypergraphs: Regularity Lemmas

Download www.math.uni-hamburg.de

Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and authors and obtain a stronger and more “user friendly” regularity lemma for hypergraphs.

Vojtech Rödl, Mathias Schacht

Real-time Traffic

CPC 2007 | Powerful Tool | Regularity Lemma | Subsequent Applications |

claim paper

Related Content

» Regular Partitions of Hypergraphs Counting Lemmas

» Applications of the regularity lemma for uniform hypergraphs

» Quasirandomness Counting and Regularity for 3Uniform Hypergraphs

» The counting lemma for regular kuniform hypergraphs

» Can a Graph Have Distinct Regular Partitions

» Almost all triple systems with independent neighborhoods are semibipartite

» Edge distribution and density in the characteristic sequence

» Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions

» Ramsey properties of random discrete structures

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CPC
Authors	Vojtech Rödl, Mathias Schacht

Comments (0)