Extremal graphs for blow-ups of cycles and trees

zbMath1266.05074arXiv1210.7869MaRDI QIDQ1953455

Hong Liu

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (15)

Extremal graphs for blow-ups of stars and paths ⋮ Extremal graph for intersecting odd cycles ⋮ The Turán number of the triangular pyramid of 3-layers ⋮ Extremal graphs for blow-ups of keyrings ⋮ Extremal graphs for odd-ballooning of paths and cycles ⋮ Extremal graphs for edge blow-up of graphs ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ Extremal graphs for odd wheels ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ Generalized Turán numbers for the edge blow-up of a graph ⋮ Turán number for odd‐ballooning of trees ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ The Turán number for the edge blow-up of trees ⋮ Supersaturation problem for the bowtie ⋮ The Turán number of the square of a path

This page was built for publication: Extremal graphs for blow-ups of cycles and trees