All Questions

I am studying a special kind of graphs, and I would like to know if they are studied in the literature and what they are called. Let $G$ be a simple, finite, undirected, connected graph, with vertex ...

Let $T$ be a triangle-free graph on $n$ vertices with minimum degree $\delta$ (which can be $0$). How does one show that $n >2\delta -1$? It seems to be true for bipartite graphs, but I cannot see ...

I am interested in regular graphs in which every edge lies in a triangle. For 3-regular graphs, only the complete graph $K_4$ has this property, so there's not much to see here. For 4-regular graphs,...