Extremal graphs for edge blow-up of graphs

DOI10.1016/J.JCTB.2021.10.006MaRDI QIDQ2664560zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 November 2021

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

edge blow-upKeevash-Sudakov conjectureTurán number

Mathematics Subject Classification ID

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

Abstract: Given a graph $H$ and an integer $p$, the {it edge blow-up} of $H$, denoted as $H^{p+1}$, is the graph obtained from replacing each edge in $H$ by a clique of size $p+1$ where the new vertices of the cliques are all different. The Tur'{a}n numbers for edge blow-up of matchings were first studied by ErdH{o}s and Moon. In this paper, we determine the Tur'{a}n numbers for edge blow-up of general graphs.

Recommendations

• The Turán number for the edge blow-up of trees
• The Turán number for the edge blow-up of trees: the missing case
• Extremal graphs for blow-ups of stars and paths
• Extremal graphs for blow-ups of cycles and trees
• On the Turán number of the blow-up of the hexagon

Cites work

• Degrees and matchings
• Edges not in any monochromatic copy of a fixed graph
• Extremal graph for intersecting odd cycles
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Extremal graphs for blow-ups of cycles and trees
• Extremal graphs for blow-ups of keyrings
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal graphs for odd wheels
• Extremal graphs for odd-ballooning of paths and cycles
• Extremal graphs for the k-flower
• Graphs with restricted valency and matching number
• scientific article; zbMATH DE number 3211575 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Intersection theorems for systems of sets
• On edges not in monochromatic copies of a fixed bipartite graph
• On Independent Complete Subgraphs in a Graph
• On maximal paths and circuits of graphs
• On the number of edges not covered by monochromatic copies of a fixed graph.
• On the structure of linear graphs
• The extremal graph problem of the icosahedron
• The history of degenerate (bipartite) extremal graph problems
• The Turán number for the edge blow-up of trees

Cited in

(32)

• Extremal graphs of the \(p\)th power of paths
• Extremal and Ramsey results on graph blowups
• The Turán number for the edge blow-up of trees
• Extremal graphs for blow-ups of keyrings
• The Turán number for the edge blow-up of trees: the missing case
• Extremal traceable graphs with non-traceable edges
• On the Turán number of the blow-up of the hexagon
• Extremal graphs for odd wheels
• Extremal Problems for Hypergraph Blowups of Trees
• 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
• Edges Not Covered by Monochromatic Bipartite Graph
• Turán number for odd‐ballooning of trees
• Extremal graphs with given order and the rupture degree
• How connectivity affects the extremal number of trees
• Two Ramsey problems in blowups of graphs
• Spectral extremal graphs for edge blow-up of star forests
• Generalized Turán results for edge blow-up of star forests
• Turán number of the odd-ballooning of complete bipartite graphs
• On the Turán number of edge blow-ups of cliques
• Extremal graphs for the odd prism
• Turán number of two vertex-disjoint copies of cliques.
• Extremal graphs for the suspension of edge-critical graphs
• Generalized Turán number for edge blow-up of paths and cycles
• Extremal graphs for disjoint union of vertex-critical graphs
• Spectral extremal results on edge blow-up of graphs
• The exact Turán number of disjoint graphs -- a generalization of Simonovits' theorem, and beyond
• Decomposition family and spectral extremal problems on non-bipartite graphs
• The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
• How connectivity affects the extremal number of trees (extended abstract)
• Spectral skeletons and applications
• Extremal graphs for blow-ups of stars and paths

This page was built for publication: Extremal graphs for edge blow-up of graphs

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