Triangle-Free Graphs with High Minimal Degrees

DOI10.1017/S0963548300000845zbMath0792.05078MaRDI QIDQ4290098

Guoping Jin

Publication date: 24 July 1994

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

zbMATH Keywords

triangle-free graphminimal degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Dense graphs with small clique number ⋮ On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs ⋮ Cycle-maximal triangle-free graphs ⋮ A note on generalized pentagons ⋮ On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs ⋮ Graphs of odd girth 7 with large degree

Cites Work

• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On a valence problem in extremal graph theory

This page was built for publication: Triangle-Free Graphs with High Minimal Degrees