28 search results - page 3 / 6 » cpc 2007 |
CPC
2007
14 years 11 months ago
2007
We continue the study of regular partitions of hypergraphs. In particular we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from [Regular partitions...
102
click to vote
CPC
2007
14 years 11 months ago
2007
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 de...
CPC
2007
14 years 11 months ago
2007
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
CPC
2007
14 years 11 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
CPC
2007
14 years 11 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...