On a conjecture of Erdős for multiplicities of cliques
From MaRDI portal
Publication:2376784
DOI10.1016/J.JDA.2012.10.005zbMATH Open1268.05147OpenAlexW2084966456WikidataQ123251275 ScholiaQ123251275MaRDI QIDQ2376784FDOQ2376784
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
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
- Title not available (Why is that?)
- On Sets of Acquaintances and Strangers at any Party
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
- Multiplicities of subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicity of complete graphs
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- Graph products and monochromatic multiplicities
- Cycles in graphs and functional inequalities
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- On Subgraphs of the Complete Bipartite Graph
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)
