COMBINATORICA · 1998 · 65 citations · 11 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsProbability TheoryCombinatorial OptimizationExtremal CombinatoricsGraph AlgorithmsGraph TheoryProbabilistic CombinatoricsComputational Complexity Of Graph AlgorithmsRandom Graph ModelsRandom Graph TheoryRandom Graphs
11
Cycles of even length in graphs
J. A. Bondy, Miklós Simonovits · Journal of Combinatorial Theory Series B · 1974 · 412 citations
Compactness results in extremal graph theory
Paul Erdős, Miklós Simonovits · COMBINATORICA · 1982 · 139 citations
On the number of graphs without 4-cycles
Daniel J. Kleitman, Kenneth Winston · Discrete Mathematics · 1982 · 133 citations