Work

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

Year: 2025

Type: article

Abstract: 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.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.23244

Authors: József Balogh, Domagoj Bradač, Bernard Lidický

Institutions: University of Illinois Urbana-Champaign, University of Illinois System, ETH Zurich, Iowa State University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funders: National Science Foundation, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, University of Illinois at Urbana-Champaign, University of Colorado Denver