@article{5d0cc4920e5949b79489f04eb4eebc40,
title = "A probabilistic counting lemma for complete graphs",
keywords = "Szemeridi regularity, sparse graph, counting lemma, Turans problem in random graphs, SPARSE RANDOM GRAPHS, K-4-FREE SUBGRAPHS, REGULARITY LEMMA, THEOREM",
author = "Stefanie Gerke and Martin Marciniszyn and Angelika Steger",
year = "2007",
month = dec,
doi = "10.1002/rsa.20198",
language = "English",
volume = "31",
pages = "517--534",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "4",
}