Prefer a chat interface with context about you and your work?
Another Infinite Sequence of Dense Triangle-Free Graphs
The core is the unique homorphically minimal subgraph of a graph. A triangle-free graph with minimum degree $\delta > n/3$ is called dense. It was observed by many authors that dense triangle-free graphs share strong structural properties and that the natural way to describe the structure of these graphs is …