Sparse halves in dense triangle-free graphs

DOI10.1016/j.jctb.2015.04.006zbMath1319.05043arXiv1311.5818OpenAlexW2002473456MaRDI QIDQ490981

Liana Yepremyan, Serguei Norine

Publication date: 21 August 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

blowupminimum degreetriangle-free graphPetersen graphedit distancesparse half

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (5)

On the local density problem for graphs of given odd-girth ⋮ Sparse halves in K4‐free graphs ⋮ K4$K_4$‐free graphs have sparse halves ⋮ The Spectrum of Triangle-Free Graphs ⋮ More about sparse halves in triangle-free graphs

Cites Work

• Unnamed Item
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Testing properties of graphs and functions
• A local density condition for triangles
• Some old and new problems in various branches of combinatorics
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the edge distribution in triangle-free graphs
• Triangle-free four-chromatic graphs
• On Turán's \((3,4)\)-problem with forbidden subgraphs
• Sparse halves in triangle-free graphs
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Triangle-Free Graphs with Large Degree
• The binding number of a graph and its Anderson number

This page was built for publication: Sparse halves in dense triangle-free graphs