Joints in graphs
组合数学
2007-05-23 v1
摘要
In 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.
关键词
引用
@article{arxiv.math/0410217,
title = {Joints in graphs},
author = {B. Bollobas and V. Nikiforov},
journal= {arXiv preprint arXiv:math/0410217},
year = {2007}
}
备注
13 pages