Joints in graphs

Simple item page
dc.creatorBollobas, B.
dc.creatorNikiforov, V.
dc.date2004-10-08
dc.date.accessioned2026-07-07T05:13:04Z
dc.date.available2026-07-07T05:13:04Z
dc.descriptionIn 1969 Erdoes found a lower bound on the number of (r+1)-cliques sharing an edge in graphs with n vertices and t(r,n)+1 edges, where t(r,n) is the size of the Turan graph of order n and r color classes. We improve Erdoes's bound and prove a related stability result.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0410217
dc.identifierhttp://arxiv.org/abs/math/0410217
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72809
dc.subjectCombinatorics
dc.subject05C35
dc.titleJoints in graphs
dc.typetext

Files

Collections

arXiv