Books in graphs

DOI10.1016/J.EJC.2004.01.007MaRDI QIDQ1765610zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Vladimir Nikiforov

Publication date 23 February 2005

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0405080

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Abstract: 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.

Recommendations

• Books versus triangles
• Books versus triangles at the extremal density
• scientific article; zbMATH DE number 881161
• A note on Ramsey numbers for books
• Book Ramsey Numbers and Quasi-Randomness

Cites work

• scientific article; zbMATH DE number 3645135 (Why is no real title available?)
• scientific article; zbMATH DE number 3659602 (Why is no real title available?)
• scientific article; zbMATH DE number 554066 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 881161 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• A note on Ramsey numbers for books
• Extremal problems and generalized degrees
• On a theorem of Rademacher-Turán
• On ramsey numbers for books
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Problems and results in combinatorial analysis and graph theory

Cited in

(15)

• Stacked book graphs are cycle-antimagic
• Books versus triangles
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Books versus triangles at the extremal density
• Large joints in graphs
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Ramsey numbers of large books
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• Saturation numbers of books
• New upper bounds for Ramsey numbers of books
• Short proofs of some extremal results. III
• Star-critical Ramsey numbers involving large books
• Graphs with small book thickness
• Bounds for chromatic number in terms of even-girth and booksize
• On a problem of Erdős and Rothschild on edges in triangles

This page was built for publication: Books in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765610)