DMTCS Proceedings, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Font Size:  Small  Medium  Large
DMTCS Conference vol AE (2005), pp. 309-316

DMTCS

2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Stefan Felsner (ed.)

DMTCS Conference Volume AE (2005), pp. 309-316


author: Stefanie Gerke, Martin Marciniszyn and Angelika Steger
title: A Probabilistic Counting Lemma for Complete Graphs
keywords:
abstract: We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma. More precisely, we consider the number of complete graphs
K
on
vertices in
-partite graphs where each partition class consists of
n
vertices and there is an
ε
-regular graph on
m
edges between any two partition classes. We show that for all 
β> 0
, at most a
β
m
-fraction of graphs in this family contain less than the expected number of copies of
K
provided
ε
is sufficiently small and
m ≥Cn
2-1/(ℓ-1)
for a constant 
C > 0
and
n
sufficiently large. This result is a counting version of a restricted version of a conjecture by Kohayakawa, Łuczak and Rödl [MR1479298] and has several implications for random graphs.
  If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.
reference: Stefanie Gerke and Martin Marciniszyn and Angelika Steger (2005), A Probabilistic Counting Lemma for Complete Graphs, in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Stefan Felsner (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AE, pp. 309-316
bibtex: For a corresponding BibTeX entry, please consider our BibTeX-file.
ps.gz-source: dmAE0161.ps.gz (78 K)
ps-source: dmAE0161.ps (193 K)
pdf-source: dmAE0161.pdf (176 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.


Automatically produced on Di Sep 27 10:09:59 CEST 2005 by gustedt

Valid XHTML 1.0 Transitional