Triangle-Free Graphs with Large Degree

DOI10.1017/S0963548397003167zbMath0884.05055OpenAlexW2029216521MaRDI QIDQ4372989

Guoping Jin, Khee Meng Koh, C. C. Chen

Publication date: 12 March 1998

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003167

zbMATH Keywords

Mycielski graphGroetzsch graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (8)

The chromatic profile of locally colourable graphs ⋮ Dense graphs with small clique number ⋮ On the local density problem for graphs of given odd-girth ⋮ On the Structure of Graphs with Given Odd Girth and Large Minimum Degree ⋮ The chromatic profile of locally bipartite graphs ⋮ The minimum degree removal lemma thresholds ⋮ Sparse halves in dense triangle-free graphs ⋮ The binding number of a graph and its cliques

This page was built for publication: Triangle-Free Graphs with Large Degree