Weighted Turán theorems with applications to Ramsey-Turán type of problems

2023/02/15 by Balogh, József, Bradač, Domagoj, Lidický, Bernard · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2302.07859

Abstract

We study extensions of Turán Theorem in edge-weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey-Turán type problems. Some of our proofs are based on the method of graph Lagrangians, while the other proofs use flag algebras. Using these results, we prove several new upper bounds on the Ramsey-Turán density of cliques. Other applications of our results are in a recent paper of Balogh, Chen, McCourt and Murley.

Cited by

• Localization of spectral Turán-type theorems

Related

• On vertex-induced weighted Turán problems
• Weighted Turan Problems with Applications
• Generalized Ramsey--Turán density for cliques
• Turán and Ramsey-type results for unavoidable subgraphs
• A new spectral Turán theorem for weighted graphs and consequences