On vertex-induced weighted Turán problems

DOI10.1016/J.DISC.2021.112628MaRDI QIDQ2237208zbMATH OpenOpenAlexFDO

Authors Zixiang Xu, Yifan Jing, Gennian Ge

Publication date 27 October 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Stone theoremTurán problemsvertex-induced weightweighted graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Enumeration in graph theory (05C30)

Abstract: Recently, Bennett et al. introduced the vertex-induced weighted Tur'an problem. In this paper, we consider their open Tur'an problem under sum-edge-weight function and characterize the extremal structure of $K_l$-free graphs. Based on these results, we propose a generalized version of the ErdH{o}s-Stone theorem for weighted graphs under two types of vertex-induced weight functions.

Review text

In this paper, the authors consider the vertex-induced weighted Turán problems introduced by \textit{P. Bennett} et al. [ibid. 342, No. 8, 2165--2172 (2019; Zbl 1418.05079)], being mainly focused on the sum-edge-weight Turán problems. They first characterize the extremal structure of \(K_{\ell}\)-free graph under sum-edge-weight function and give the similarities and differences with the previous structure under product-edge-weight function. Based on the results of complete graphs, a generalized version of the Erdős-Stone theorem for weighted graphs was proposed under both of the two types of vertex-induced weight functions.

Recommendations

• A weighted generalization of Tur�n's theorem
• scientific article; zbMATH DE number 5053310
• Turán problems for integer-weighted graphs
• Weighted Turán problems with applications
• Weighted variants of the Andrásfai-Erdős-Sós theorem

Cites work

• \(H\)-factors in dense graphs
• A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
• A generalization of Menger's theorem
• A proof of a conjecture of Bondy concerning paths in weighted digraphs
• A weighted generalization of Tur�n's theorem
• An analogue of the Erdős-Stone theorem for finite geometries
• Cycles in weighted graphs
• Heavy cycles in weighted graphs
• Heavy paths and cycles in weighted graphs
• scientific article; zbMATH DE number 4101240 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• On the Erdös-Stone Theorem
• On the Structure of Edge Graphs
• On the Structure of Edge Graphs II
• On the structure of linear graphs
• Turán problems for integer-weighted graphs
• Weighted degrees and heavy cycles in weighted graphs
• Weighted Turán problems with applications

Cited in

(3)

• Weighted Turán problems with applications
• Maximum weighted induced subgraphs
• Turán problems for integer-weighted graphs

This page was built for publication: On vertex-induced weighted Turán problems

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