On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6

DOI10.1007/s004930200024zbMath1012.05094OpenAlexW1982114488WikidataQ123127360 ScholiaQ123127360MaRDI QIDQ1872896

Frantisek Franek

Publication date: 18 May 2003

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200024

zbMATH Keywords

extremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

Inducibility and universality for trees ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ Non-bipartite \(k\)-common graphs ⋮ Toward characterizing locally common graphs ⋮ On the Ramsey multiplicity of complete graphs ⋮ Two-colorings with many monochromatic cliques in both colors ⋮ A note on the inducibility of 4-vertex graphs

This page was built for publication: On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6