independent setsdominationenumerationextremal graph theoryWe give a survey of the enumeration of independent sets in graphs and of some related problems.doi:10.1515/dma-2016-0028Dainyak, Aleksandr B.Sapozhenko, Aleksandr A.Discrete Mathematics & Applications...
摘要: We give a survey of the enumeration of independent sets in graphs and of some related problems.关键词: independent sets domination enumeration extremal graph theory DOI: 10.1515/dma-2016-0028 被引量: 8 年份: 2016 收藏 引用 批量引用 报错 分享 ...
Spielman所著图书 《Spectral and Algebraic Graph Theory》(电子版链接)第十九章 Ch19: Independent Sets and Coloring 中的内容。 19.1 概要 自这一章开始,我们开始研究图谱理论与图结构之间的关系。稍微具体一点,也就是图拉普拉斯矩阵、图邻接矩阵的特征值,特征向量与定义在图上的结构问题的联系。(不完全准确哈)...
Given a graph G, let fG(n,m) be the minimal number k such that every k independent n-sets in G have a rainbow m-set. Let D(2) be the family of all graphs with maximum degree at most two. For t≥3, let Ct be the cycle with vertex set [1,t] and edge set {12,23,…,(...
In graph theory, an independent set is a set of nonadjacent vertices in a graph. Moreover, an independent set is maximum if it has the maximum cardinality (in this case, the number of vertices) across all independent sets in a graph. ...
We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationships between them. We prove that independent set reconfigurability in perfect graphs (under any of the three ...
In this note we present several results related to conjectures of Erdős and Hajnal on the existence of independent sets with good arithmetic properties in a locally sparse graph whose vertices are natural numbers. In particular, we prove that if k, ℓ ≥ 2 and a graph G define...
Füredi, Z.: The number of maximal independent sets in connected graphs. J. Graph Theory 11, 463–470 (1987) Article MathSciNet MATH Google Scholar Jin, Z., Li, X.: Graphs with the second largest number of maximal independent sets. Discrete Math. 308, 5864–5870 (2008) Article Math...
A graph is d-regular if all vertices have degree d. In the family of d-regular graphs of the same size, which graph has the largest number of independent sets? This ques- tion was initially raised by Andrew Granville in connection to combinatorial number theory and appeared first in print...
Independent Sets in Graph Powers are Almost Contained in Juntas We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite.Consider the stationary measure of the simple ... I Dinur,E Friedgut,O Regev - 《Geometric & Functional Analysis》 被引量...