On the Turán number of edge blow-ups of cliques

DOI10.1137/23M1623240zbMATH Open1547.05137MaRDI QIDQ6606916FDOQ6606916

Authors: Jialei Song, Changhong Lu, Long-Tu Yuan 

Publication date: 17 September 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Extremal graphs for edge blow-up of graphs
• Generalized Turán numbers for the edge blow-up of a graph
• 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
• Generalized Turán results for edge blow-up of star forests

zbMATH Keywords

complete graphedge blow-upTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• On the structure of linear graphs
• Title not available (Why is that?)
• The Erdős‐Sós Conjecture for trees of diameter four
• Extremal graphs for blow-ups of cycles and trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Independent Complete Subgraphs in a Graph
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Extremal graphs for edge blow-up of graphs
• The Turán number for the edge blow-up of trees: the missing case

Cited In (2)

• Spectral extremal graphs for edge blow-up of star forests
• Generalized Turán numbers for the edge blow-up of a graph

This page was built for publication: On the Turán number of edge blow-ups of cliques

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