Let F(G) be the number of forests of a graph G. Similarly let C(G) be the number of connected spanning subgraphs of a connected graph G. We bound F(G) and C(G) for regular graphs and for graphs with a fixed average degree. Among many other things we study fd=supG∈GdF(G)1/v(G)\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$f_d=\sup _{G\in {\mathcal {G}}_d}F(G)^{1/v(G)}$$\end{document}, where Gd\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathcal {G}}_d$$\end{document} is the family of d-regular graphs, and v(G) denotes the number of vertices of a graph G. We show that f3=23/2\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$f_3=2^{3/2}$$\end{document}, and if (Gn)n\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$(G_n)_n$$\end{document} is a sequence of 3-regular graphs with the length of the shortest cycle tending to infinity, then limn→∞F(Gn)1/v(Gn)=23/2\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\lim _{n\rightarrow \infty }F(G_n)^{1/v(G_n)}=2^{3/2}$$\end{document}. We also improve on the previous best bounds on fd\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$f_d$$\end{document} for 4≤d≤9\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$4\le d\le 9$$\end{document}.
机构:
Qinghai Normal Univ, Sch Math & Stat, Xining 810001, Peoples R ChinaQinghai Normal Univ, Sch Math & Stat, Xining 810001, Peoples R China
Deng, Bo
Zhu, Xiaoyu
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaQinghai Normal Univ, Sch Math & Stat, Xining 810001, Peoples R China
Zhu, Xiaoyu
Zhao, Haixing
论文数: 0引用数: 0
h-index: 0
机构:
Qinghai Normal Univ, Sch Math & Stat, Xining 810001, Peoples R ChinaQinghai Normal Univ, Sch Math & Stat, Xining 810001, Peoples R China