中文
相关论文

相关论文: Independence complexes of generalized Mycielskian …

200 篇论文

The global formality of Dolgushev depends on the choice of a torsion-free covariant derivative. We prove that the globalized formalities with respect to two different covariant derivatives are homotopic. More explicitly, we derive the…

量子代数 · 数学 2021-02-23 Andreas Kraft , Jonas Schnitzer

The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…

组合数学 · 数学 2017-10-11 J. I. Brown , D. Cox

The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive…

交换代数 · 数学 2020-03-03 Nursel Erey

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…

逻辑 · 数学 2007-05-23 Jaroslav Nešetřil , Saharon Shelah

We show that the homotopy type of a finite oriented Poincar\'{e} 4-complex is determined by its quadratic 2-type provided its fundamental group is finite and has a dihedral Sylow 2-subgroup. By combining with results of Hambleton-Kreck and…

几何拓扑 · 数学 2022-12-21 Daniel Kasprowski , John Nicholson , Benjamin Ruppik

We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is…

群论 · 数学 2020-09-04 Benjamin Brück , Radhika Gupta

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

组合数学 · 数学 2009-04-14 Julia Brown

Given a graph $G$, the \textit{independence complex} $I(G)$ is the simplicial complex whose faces are the independent sets of $V(G)$. Let $\tilde{b}_i$ denote the $i$-th reduced Betti number of $I(G)$, and let $b(G)$ denote the sum of…

组合数学 · 数学 2021-10-19 Hehui Wu , Wentao Zhang

In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then…

代数拓扑 · 数学 2021-07-19 Connor Donovan , Maxwell Lin , Nicholas A. Scoville

An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\sum_{A} x^{|A|}$, summed over…

组合数学 · 数学 2018-12-10 Somayeh Jahari , Saeid Alikhani

The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…

组合数学 · 数学 2022-09-08 Margaret Bayer , Marija Jelić Milutinović , Julianne Vega

We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.

代数拓扑 · 数学 2024-04-05 David Blanc , Surojit Ghosh , Aziz Kharoof

The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…

组合数学 · 数学 2025-12-10 Dhanya Roy , Sandi Klavžar , Aparna Lakshmanan

We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we…

组合数学 · 数学 2007-05-23 Alexander Engström

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

组合数学 · 数学 2007-05-23 Svante Linusson , John Shareshian , Volkmar Welker

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

代数拓扑 · 数学 2024-09-02 Shiquan Ren

Let $M$ be an orientable, simply-connected, closed, non-spin 4-manifold and let $\mathcal{G}_k(M)$ be the gauge group of the principal $G$-bundle over $M$ with second Chern class $k\in\mathbb{Z}$. It is known that the homotopy type of…

代数拓扑 · 数学 2018-07-06 Tseleung So

Let $X,Y$ be $(n-1)$-connected finite pointed CW-complexes of dimension at most $n+2$, $n\geq 3$. In this paper we give elementary proofs of the abelian group structure of $[X,Y]$ of homotopy classes of based maps from $X$ to $Y$, which was…

代数拓扑 · 数学 2024-02-02 Pengcheng Li

We introduce the separability complex, a one-complex associated to a finite regular cover of the rose and show that it is connected if and only if the fundamental group of the associated cover is generated by its intersection with the set…

几何拓扑 · 数学 2026-01-21 Becky Eastham

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

综合数学 · 数学 2019-10-14 Somayeh Jahari , Saeid Alikhani