English
Related papers

Related papers: The Kuenneth formula for graphs

200 papers

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

Combinatorics · Mathematics 2025-04-15 Yizhe Ji , Quanyu Tang , Wei Wang , Hao Zhang

Let $G= (V,E)$ be a finite graph. For $d_0>0$ we say that $G$ is $d_0$-regular, if every $v\in V$ has degree $d_0$. We say that $G$ is $(d_0, d_1)$-regular, for $0<d_1<d_0$, if $G$ is $d_0$ regular and for every $v\in V$, the subgraph…

Combinatorics · Mathematics 2023-08-28 Ehud Friedgut , Yonatan Iluz

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

Commutative Algebra · Mathematics 2020-08-13 Takayuki Hibi , Hiroju Kanno , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…

Combinatorics · Mathematics 2013-06-25 Sally Cockburn

An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then…

Discrete Mathematics · Computer Science 2013-03-12 Vadim E. Levit , Eugen Mandrescu

Let $\Gamma$ be a function that maps two arbitrary graphs $G$ and $H$ to a non-negative real number such that $$\alpha(G^{\boxtimes n})\leq \alpha(H^{\boxtimes n})\Gamma(G,H)^n$$ where $n$ is any natural number and $G^{\boxtimes n}$ is the…

Combinatorics · Mathematics 2024-12-10 Sharareh Alipour , Amin Gohari , Mehrshad Taziki

Let G=SU(2) and let \Omega G denote the space of continuous based loops in G, equipped with the pointwise conjugation action of G. It is a classical fact in topology that the ordinary cohomology H^*(\Omega G) is a divided polynomial algebra…

K-Theory and Homology · Mathematics 2012-06-11 Megumi Harada , Lisa C. Jeffrey , Paul Selick

A set of vertices $W$ {\em resolves} a graph $G$ if every vertex of $G$ is uniquely determined by its vector of distances to the vertices in $W$. The {\em metric dimension} for $G$, denoted by $\dim(G)$, is the minimum cardinality of a…

Combinatorics · Mathematics 2012-11-08 Min Feng , Kaishun Wang

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Computational Complexity · Computer Science 2013-06-10 Jonah Blasiak , Ketan D. Mulmuley , Milind Sohoni

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

Group Theory · Mathematics 2026-01-14 Víctor Sotomayor

A graph $G$ is said to be {\em hom-idempotent} if there is a homomorphism from $G^2$ to $G$, and {\em weakly hom-idempotent} if for some $n \geq 1$ there is a homomorphism from $G^{n+1}$ to $G^n$. Larose et al. [{\em Eur. J. Comb.…

Combinatorics · Mathematics 2016-04-26 Pablo Torres , Mario Valencia-Pabon

Let $G$ be a finite simple graph on the vertex set $[n] = \{ 1, \ldots, n \}$ and $K[X, Y] = K[x_1, \ldots, x_n, y_1, \ldots, y_n]$ the polynomial ring in $2n$ variables over a field $K$ with each $\mathrm{deg} x_i = \mathrm{deg} y_j = 1$.…

Commutative Algebra · Mathematics 2020-08-27 Takayuki Hibi , Kazunori Matsuda

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they…

Combinatorics · Mathematics 2021-03-11 Mark Pankov , Krzysztof Petelczyc , Mariusz Zynel

Given finite simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex having the graph homomorphisms $G\to H$ as the vertices. We determine the homotopy type of each connected component of $\mathrm{Hom}(G,H)$…

Combinatorics · Mathematics 2025-09-16 Soichiro Fujii , Kei Kimura , Yuta Nozaki

Given a graph $G=(V,E)$, an integer $k$, and a function $f_G:V^k \times V^k \to {0,1}$, the $k^{th}$ graph product of $G$ w.r.t $f_G$ is the graph with vertex set $V^k$, and an edge between two vertices $x=(x_1,...,x_k)$ and…

Discrete Mathematics · Computer Science 2013-09-05 Michael Langberg , Dan Vilenchik

The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…

Combinatorics · Mathematics 2026-02-04 Takahiro Matsushita

The thickness of a graph $G$ is the minimum number of planar subgraphs whose union is $G$. In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker product $G\times H$ of two graphs $G$ and $H$. We also give…

Combinatorics · Mathematics 2019-01-25 Xia Guo , Yan Yang

Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…

Complex Variables · Mathematics 2023-09-13 Pritthijit Biswas

We study the cup product on the Hochschild cohomology of the stack quotient [X/G] of a smooth quasi-projective variety X by a finite group G. More specifically, we construct a G-equivariant sheaf of graded algebras on X whose G-invariant…

Algebraic Geometry · Mathematics 2018-12-13 Cris Negron , Travis Schedler , Pieter Belmans , Pavel Etingof

Let $G$ be a connected graph. For an ordered set $S=\{v_1,\ldots, v_\ell\}\subseteq V(G)$, the vector $r_G(v|S) = (d_G(v_1,v), \ldots, d_G(v_\ell,v))$ is called the metric $S$-representation of $v$. If for any pair of different vertices…

Combinatorics · Mathematics 2021-02-15 Sandi Klavžar , Freydoon Rahbarnia , Mostafa Tavakoli