Joints in graphs

@article{Bollobs2008JointsIG,
  title={Joints in graphs},
  author={B{\'e}la Bollob{\'a}s and Vladimir Nikiforov},
  journal={Discrete Mathematics},
  year={2008},
  volume={308},
  pages={9-19}
}
In 1969 Erd1⁄2os proved that if r 2 and n > n0 (r) ; every graph G of order n and e (G) > tr (n) has an edge that is contained in at least nr 1= (10r) 6r cliques of order (r + 1) : In this note we improve this bound to nr 1=rr+5: We also prove a corresponding stability result. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

P

  • B. Andrásfai
  • Erd1⁄2os, V. T. Sós, On the connection between…
  • 1974
Highly Influential
4 Excerpts

Modern Graph Theory

  • B. Bollobás
  • Graduate Texts in Mathematics, 184, Springer…
  • 1998

Bonferroni-type inequalities with applications

  • J. Galambos, I. Simonelli
  • Probability and its Applications (New York…
  • 1996
1 Excerpt

On the Erd1⁄2os-Rényi generalization of the Borel-Cantelli lemma

  • T. F. Móri, G. J. Székely
  • Studia Sci. Math. Hungar. 18
  • 1983
3 Excerpts

Probabilities of complex events and linear programming , ( Russian )

  • S. A. Pirogov
  • Teor . Verojatnost . i Primenen .
  • 1983

The Nordhaus-Stewart-Moon-Moser inequality

  • N. Khadμziivanov, V. Nikiforov
  • (Russian), Serdica 4
  • 1978
1 Excerpt

Geometrical estimates and problems from combinatorial geometry (Russian)

  • D. O. Shklarsky, N. N. Chentzov, I. M. Yaglom
  • Library of the Mathematical Circle, No. 13 Nauka…
  • 1974
1 Excerpt

On the number of complete subgraphs and circuits contained in graphs, μ

  • P. Erd1⁄2os
  • Casopis Pμest. Mat
  • 1969
1 Excerpt

Similar Papers

Loading similar papers…