K4K₄‐free graphs have sparse halves

From MaRDI portal
Publication:6096775

DOI10.1112/BLMS.12782zbMATH Open1521.05085arXiv2108.07297OpenAlexW4313365414MaRDI QIDQ6096775FDOQ6096775


Authors: Christian Reiher Edit this on Wikidata


Publication date: 15 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: Every K4-free graph on n vertices has a set of lfloorn/2floor vertices spanning at most n2/18 edges.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: K4$K_4$‐free graphs have sparse halves

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