On the Structure of Dense Triangle-Free Graphs
From MaRDI portal
Recommendations
Cited in
(23)- The homomorphism threshold of \({C_3, C_5}\)-free graphs
- The generic circular triangle-free graph
- On the edit distance from \(K_{2,t}\)-free graphs
- No dense subgraphs appear in the triangle-free graph process
- On the structure of triangle-free graphs of large minimum degree
- The minimum degree removal lemma thresholds (extended abstract)
- On the Minimal Density of Triangles in Graphs
- The local density of triangle-free graphs
- Triangle-Free Graphs with High Minimal Degrees
- Triangle-free graphs and forbidden subgraphs
- On the density of trigraph homomorphisms
- Convex-round graphs are circular-perfect
- Cycle-maximal triangle-free graphs
- The minimum degree removal lemma thresholds
- An analogue of Hajós' theorem for the circular chromatic number
- The chromatic profile of locally bipartite graphs
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
- Sparse halves in dense triangle-free graphs
- Semi-regular graphs of minimum independence number
- Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon
- The typical structure of maximal triangle-free graphs
- Critical graphs without triangles: an optimum density construction
- Describing hereditary properties by forbidden circular orderings
This page was built for publication: On the Structure of Dense Triangle-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256688)
