Books in graphs

Books in graphs (2008)

by Béla Bollobás , Vladimir Nikiforov

Citations:

User correction supplied by ynaamad

Datum	Value	Source
TITLE	Books in graphs	user correction
AUTHOR NAME	Béla Bollobás	user correction
AUTHOR AFFIL	1	user correction
AUTHOR NAME	Vladimir Nikiforov	user correction
AUTHOR AFFIL	1	user correction
ABSTRACT	A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) n 2 with 0 < α < 17 −3 (), and G has no book of size at least graph G1 of order at least	SVM HeaderParse 0.2
YEAR	2008	user correction
CITATIONS	12 found	ParsCit 1.0