Sparse halves in K4‐free graphs

DOI10.1002/jgt.22722zbMath1522.05214arXiv2007.14623OpenAlexW3184635925MaRDI QIDQ6056789

Jie Ma, Xizhi Liu

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

local densityTurán's theoremsparse halves

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Related Items (1)

K4$K_4$‐free graphs have sparse halves

Cites Work

• Unnamed Item
• Unnamed Item
• A note on independent sets in graphs with large minimum degree and small cliques
• Sparse halves in dense triangle-free graphs
• How to make a graph bipartite
• Making a \(K_4\)-free graph bipartite
• A local density condition for triangles
• Some old and new problems in various branches of combinatorics
• On the edge distribution in triangle-free graphs
• On the local density problem for graphs of given odd-girth
• Sparse halves in triangle-free graphs

This page was built for publication: Sparse halves in K4‐free graphs