On vertex-induced weighted Tur\'an problems
Combinatorics
2019-02-26 v3
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 -free graphs. Based on these results, we propose a generalized version of the Erd\H{o}s-Stone theorem for weighted graphs under two types of vertex-induced weight functions.
Cite
@article{arxiv.1812.11700,
title = {On vertex-induced weighted Tur\'an problems},
author = {Zixiang Xu and Yifan Jing and Gennian Ge},
journal= {arXiv preprint arXiv:1812.11700},
year = {2019}
}