Bela Bollobas, Vladimir Nikiforov
Published 2004-05-05Version 1
A book of size $q$ is a set of $q$ triangles sharing a common edge. We study the size of the maximal book in a graph as a function of the number of its edges. In particular, we answer two questions of Erdos about graphs that are union of triangles.
Comments: 13 pages, accepted in Eur. J. Combin
A note on Ramsey Numbers for Books
A note on a problem of Erdos and Rothschild
On uniquely 3-colorable plane graphs without prescribed adjacent faces
![QR code for arXiv:math/0405080 [math.CO]](http://oss.arxitics.com/images/favicon.svg)