14 search results - page 2 / 3 » Regular Partitions of Hypergraphs: Regularity Lemmas |
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
JCT
2011
13 years 8 days ago
2011
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
APAL
2010
13 years 5 months ago
2010
The characteristic sequence of hypergraphs Pn : n < associated to a formula (x; y), introduced in [5], is defined by Pn(y1, . . . yn) = (x) in (x; yi). We continue the study o...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
RSA
2010
13 years 3 months ago
2010
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...