# The minimal number of triangles or edges whose union is a graph $G$.

Let $G$ be a simple graph of order $n$. If $G$ is triangle-free, then we know that there is a bipartite graph of the same order and the same size. So $G$ has size less than $n^2/4$.

Now if it has triangles, it might have more than $n^2/4$ edges. But then if we think of the graph as a smallest union of triangles and edges, then I guess that this union involves less than $n^2/4$ triangles or edges. I tried with several examples and my guess holds for them.

Is this a known result, or is it just false?

-

What is order and size? What if $n$ is odd? $C_5$ has no bipartite graph with the same number of vertices. – draks ... Nov 28 '12 at 22:02
If I understand correctly, the question basically asks if every $n$-vertex graph can be decomposed into at most $n^2/4$ triangles and edges.  Turán's theorem implies every triangle-free graph has at most $n^2/4$ vertices, so any counter-example must have a triangle. – Douglas S. Stones Jan 6 at 0:04
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 13, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9420974850654602, "perplexity_flag": "head"}