Extremal graphs for blow-ups of keyrings

DOI10.1007/s00373-020-02203-7zbMath1472.05080OpenAlexW3039472550MaRDI QIDQ2657053

Erfang Shan, Zhenyu Ni, Hui Zhu, Li-ying Kang

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02203-7

zbMATH Keywords

keyringblow-upTurán graphextremal graphintersecting clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Extremal graphs of the \(p\)th power of paths ⋮ Extremal graphs for edge blow-up of graphs ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ The Turán number for the edge blow-up of trees: the missing case

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal graph for intersecting odd cycles
• Degrees and matchings
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal graphs for blow-ups of cycles and trees
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Turán number and decomposition number of intersecting odd cycles
• On maximal paths and circuits of graphs
• On the theory of graphs

This page was built for publication: Extremal graphs for blow-ups of keyrings