Generalization of Erdős and Rousseau's counting lemma in graph theory

zbMATH Open1174.05405MaRDI QIDQ5320159FDOQ5320159

Authors: Yu-Qin Sun 

Publication date: 22 July 2009

Recommendations

• A probabilistic counting Lemma for complete graphs
• Bipartite subgraphs
• A probabilistic counting lemma for complete graphs
• The number of \(K_{m,m}\)-free graphs
• On the Structure of Edge Graphs II

zbMATH Keywords

subgraphcounting lemmacomplete \(m\)-partite graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55)

Cited In (3)

• A probabilistic counting lemma for complete graphs
• A generalization of Tutte's 1-factor theorem to countable graphs
• Title not available (Why is that?)

This page was built for publication: Generalization of Erdős and Rousseau's counting lemma in graph theory

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