On a conjecture of Erdős for multiplicities of cliques

DOI10.1016/J.JDA.2012.10.005MaRDI QIDQ2376784zbMATH OpenOpenAlexWikidataFDO

Authors Antoine Deza, Frantisek Franek, Min Jing Liu

Publication date 24 June 2013

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.10.005

zbMATH Keywords

Cayley graphcliquecomplete graphsubgraphcoclique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• The clique density theorem
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• scientific article; zbMATH DE number 4073007

Cites work

• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• Cycles in graphs and functional inequalities
• Graph products and monochromatic multiplicities
• Multiplicities of subgraphs
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• On Sets of Acquaintances and Strangers at any Party
• On Subgraphs of the Complete Bipartite Graph
• On the Ramsey multiplicity of complete graphs
• Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey

Cited in

(5)

• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• A problem of Erdős on the minimum number of k-cliques
• A new proof of the Fisher-Ryan bounds for the number of cliques of a graph
• A note on the inducibility of 4-vertex graphs

This page was built for publication: On a conjecture of Erdős for multiplicities of cliques

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