Connector Families of Graphs
Connector Families of Graphs
复制标题
图的连接器族
DOI：
10.1007/s00373-013-1347-3
复制
发表时间：
2014
影响因子：
0.7
通讯作者：
J. Körner
中科院分区：
文献类型：
--
作者：
G. Cohen;E. Fachini;J. Körner
对于每对固定的自然数k> l，我们都会考虑完整图KN的子图的家族，使得家族中的每个图都至少具有K连接的组件，而任何两个的结合都具有l。这样的家族最多是n中的指数，并确定k和l = 1的每个值的最大家族的确切指数增长。
For every pair of fixed natural numbers k > l we consider families of subgraphs of the complete graph Kn such that each graph in the family has at least k connected components while the union of any two has at most l. We show that the cardinality of such a family is at most exponential in n and determine the exact exponential growth of the largest such families for every value of k and l = 1.