Triangle-free graphs with large minimum common degree

DOI10.1016/J.DAM.2025.09.030MaRDI QIDQ6906692zbMATH OpenFDO

Authors Jian Wang, Weihua Yang, Fan Zhao

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.09.030

zbMATH Keywords

minimum common degreetriangle-free

Mathematics Subject Classification ID

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

Cites work

• Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• What we know and what we do not know about Turán numbers

This page was built for publication: Triangle-free graphs with large minimum common degree

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