A probabilistic counting Lemma for complete graphs

MaRDI QIDQ3576710zbMATH OpenFDO

Authors Stefanie Gerke, Martin Marciniszyn, Angelika Steger

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0161/0.html

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A probabilistic counting lemma for complete graphs
• The counting lemma for regular k‐uniform hypergraphs
• Note on the 3-graph counting Lemma
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
• Extremal results in sparse pseudorandom graphs

Cited in

(10)

• \(K_4\)-free subgraphs of random graphs revisited
• Extremal subgraphs of random graphs
• A counting lemma for sparse pseudorandom hypergraphs
• Edge Distribution of Graphs with Few Copies of a Given Graph
• A completion of the proof of the Edge-statistics Conjecture
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Generalization of Erdős and Rousseau's counting lemma in graph theory
• Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
• A probabilistic counting lemma for complete graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity

This page was built for publication: A probabilistic counting Lemma for complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576710)