The minimum number of 4-cliques in graphs with triangle-free complement

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2005-01-14
dc.date.accessioned2026-07-07T05:16:03Z
dc.date.available2026-07-07T05:16:03Z
dc.descriptionWrite f(n) for the minimum number of 4-cliques in graphs of order n with triangle-free complement. Finding f(n) is a particular case of a problem raised by Erdos in 1962. We give an upper bound of f(n) and a matching lower bound when the graph is close to regular.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0501211
dc.identifierhttp://arxiv.org/abs/math/0501211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73849
dc.subjectCombinatorics
dc.subject05C35
dc.titleThe minimum number of 4-cliques in graphs with triangle-free complement
dc.typetext

Files

Collections

arXiv