The Tur\'an number for the edge blow-up of trees: the missing case
Abstract
The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Tur\'an number of the edge blow-up of trees except one particular case. Answering an problem posed by them, we determined the Tur\'an number of this particular case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.