Triangles in random graphs

DOI10.1016/j.disc.2004.08.008zbMath1056.05126OpenAlexW1998083236MaRDI QIDQ1763352

Ondřej Pangrác, Martin Loebl, Ji{ří} Matoušek

Publication date: 22 February 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.008

zbMATH Keywords

Tutte polynomialRandom graphNumber of triangles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (6)

Graph Decomposition and Parity ⋮ Local limit theorems for subgraph counts ⋮ A local central limit theorem for triangles in a random graph ⋮ Simulating weighted, directed small-world networks ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Combinatorial anti-concentration inequalities, with applications

Cites Work

• Contraction-deletion invariants for graphs
• On the addition of residue classes mod p

This page was built for publication: Triangles in random graphs