Weighted variants of the Andrásfai-Erdős-Sós theorem

DOI10.4310/JOC.2020.V11.N2.A4zbMATH Open1430.05041arXiv1710.09652WikidataQ126357073 ScholiaQ126357073MaRDI QIDQ2288015FDOQ2288015

Authors: Clara Marie Lüders, Christian Reiher 

Publication date: 16 January 2020

Published in: Journal of Combinatorics (Search for Journal in Brave)

Abstract: A well known result due to Andr'asfai, ErdH{o}s, and S'os asserts that for $rge2$ every $K_{r+1}$-free graph on $n$ vertices with $delta(G)>frac3r-43r-1n$ is $r$-partite. We study related questions in the context of weighted graphs, which are motivated by recent work on the Ramsey-Tur'an problem for cliques.

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

Recommendations

• A weighted version of the Erdős-Kac theorem
• A weighted Erdős-Ginzburg-Ziv theorem
• A Weighted Erdos-Mordell Inequality
• scientific article
• Weighted Erdős-Kac theorem in short intervals
• A family of weighted Erdős-Mordell inequality and applications
• A weighted version of the Mishou theorem
• Towards a weighted version of the Hajnal-Szemerédi theorem
• scientific article; zbMATH DE number 404362
• scientific article

zbMATH Keywords

arboricitylargest independent setsequence of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cited In (3)

• A unified approach to hypergraph stability
• Title not available (Why is that?)
• The Ramsey-Turán problem for cliques

This page was built for publication: Weighted variants of the Andrásfai-Erdős-Sós theorem

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