On the Structure of Dense Triangle-Free Graphs

DOI10.1017/S0963548399003831zbMath0942.05032OpenAlexW2023323020MaRDI QIDQ4256688

Stephan Brandt

Publication date: 21 August 2000

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

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

zbMATH Keywords

triangle-free graphPetersen graphMöbius ladder

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (11)

Triangle-free graphs and forbidden subgraphs ⋮ On the Edit Distance from K2,t-Free Graphs ⋮ The chromatic profile of locally bipartite graphs ⋮ The minimum degree removal lemma thresholds ⋮ Critical graphs without triangles: an optimum density construction ⋮ Semi-regular graphs of minimum independence number ⋮ Cycle-maximal triangle-free graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) ⋮ Describing hereditary properties by forbidden circular orderings ⋮ Convex-round graphs are circular-perfect

This page was built for publication: On the Structure of Dense Triangle-Free Graphs