# Number of edges in low complexity graphs

Is the number of edges in the 3-connected graph with the minimum number of spanning trees always $\lceil {\frac{3}{2}}n\rceil$?

-
What are some examples of such 3c-min-span graphs? Presumably you know some classes that achieve the min... –  Joseph O'Rourke Oct 14 '10 at 19:40
It seems there are no classes which achieve the minimum always. An example of a class which achieve a low number of spanning trees are Prism Graphs, but they do not always have the minimum number of spanning trees. –  utdiscant Oct 14 '10 at 20:50
For what values of n do you know this to be true? –  j.c. Oct 15 '10 at 0:18
{"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": 1, "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, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.49227526783943176, "perplexity": 409.9612727248437}, "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": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422115862432.8/warc/CC-MAIN-20150124161102-00114-ip-10-180-212-252.ec2.internal.warc.gz"}