A refined Turán theorem

DOI10.5614/EJGTA.2024.12.1.2zbMATH Open1541.05089MaRDI QIDQ6571557

Slobodan Filipovski

Publication date: 12 July 2024

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

zbMATH Keywords

inequalityextremal graphscliqueTurán theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds for the clique and the chromatic numbers of a graph
• Vraagstuk XXVIII.
• Eine Extremalaufgabe aus der Graphentheorie.
• A lower bound on the chromatic number of a graph

This page was built for publication: A refined Turán theorem

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