中文
相关论文

相关论文: Hedetniemi's conjecture from the topological viewp…

200 篇论文

A topological version of the famous Hedetniemi conjecture says: The mapping index of the Cartesian product of two $\mathbb Z/2$-spaces is equal to the minimum of their $\mathbb Z/2$-indexes. The main purpose of this article is to study the…

组合数学 · 数学 2025-07-15 Vuong Bui , Hamid Reza Daneshpajouh

The $\mathbb{Z}_2$-index ${\rm ind}(X)$ of a $\mathbb{Z}_2$-CW-complex $X$ is the smallest number $n$ such that there is a $\mathbb{Z}_2$-map from $X$ to $S^n$. Here we consider $S^n$ as a $\mathbb{Z}_2$-space by the antipodal map.…

代数拓扑 · 数学 2019-04-02 Takahiro Matsushita

One of the most famous conjecture in graph theory is Hedetniemi's conjecture stating that the chromatic number of the categorical product of graphs is the minimum of their chromatic numbers. Using a suitable extension of the definition of…

组合数学 · 数学 2014-10-14 Hossein Hajiabolhassan , Frédéric Meunier

For a graph $G$, let $\chi (G)$ denote the chromatic number. In graph theory, the following famous conjecture posed by Hedetniemi has been studied: For two graphs $G$ and $H$, $\chi (G\times H)=\min\{\chi (G),\chi (H)\}$, where $G \times H$…

组合数学 · 数学 2019-11-25 Ryoya Fukasaku , Michitaka Furuya , Akihiro Higashitani

We consider a natural graph operation $\Omega_k$ that is a certain inverse (formally: the right adjoint) to taking the k-th power of a graph. We show that it preserves the topology (the $\mathbb{Z}_2$-homotopy type) of the box complex, a…

组合数学 · 数学 2019-05-15 Marcin Wrochna

A $50$ years unsolved conjecture by Hedetniemi [{\it Homomorphisms of graphs and automata, \newblock {\em Thesis (Ph.D.)--University of Michigan}, 1966}] asserts that the chromatic number of the categorical product of two graphs $G$ and $H$…

组合数学 · 数学 2016-08-02 Meysam Alishahi , Hossein Hajiabolhassan

We survey results on Hedetniemi's conjecture which are connected to adjoint functors in the "thin" category of graphs, and expose the obstacles to extending these results.

组合数学 · 数学 2016-08-10 Jan Foniok , Claude Tardif

The core of a graph is the smallest graph (in terms of number of vertices) to which it is homomorphically equivalent. The question of the possible order of the core of the tensor product (also known as categorical, Heidetnemi or direct…

组合数学 · 数学 2025-05-13 Reza Naserasr , Cyril Pujol

In 1980, Onishchik introduced the index of a Riemannian symmetric space as the minimal codimension of a (proper) totally geodesic submanifold. He calculated the index for symmetric spaces of rank less than or equal to 2, but for higher rank…

微分几何 · 数学 2020-08-12 Jurgen Berndt , Carlos Olmos

Minkowski's second theorem can be stated as an inequality for $n$-dimensional flat Finsler tori relating the volume and the minimal product of the lengths of closed geodesics which form a homology basis. In this paper we show how this…

几何拓扑 · 数学 2023-04-03 Florent Balacheff , Steve Karam , Hugo Parlier

The Odd Hadwiger's conjecture, formulated by Gerards and Seymour in 1995, is a substantial strengthening of Hadwiger's famous coloring conjecture from 1943. We investigate whether the hierarchy of topological lower bounds on the chromatic…

组合数学 · 数学 2024-01-03 Raphael Steiner

Let $G=(V,E)$ be a simple graph with $n = |V|$ vertices and $m = |E|$ edges. The first and second Zagreb indices are among the oldest and the most famous topological indices, defined as $M_1 = \sum_{i \in V} d_i^2$ and $M_2 = \sum_{(i, j)…

组合数学 · 数学 2011-04-22 Aleksandar Ilić , Dragan Stevanović

The neighborhood complex $\N(G)$ of a graph $G$ were introduced by L. Lov{\'a}sz in his proof of Kneser conjecture. He proved that for any graph $G$, \begin{align} \label{abstract} \chi(G) \geq conn(\N(G))+3. \end{align} In this article we…

组合数学 · 数学 2018-10-17 Samir Shukla

We investigate vector chromatic number, Lovasz theta of the complement, and quantum chromatic number from the perspective of graph homomorphisms. We prove an analog of Sabidussi's theorem for each of these parameters, i.e. that for each of…

组合数学 · 数学 2013-05-27 Chris Godsil , David Roberson , Robert Šámal , Simone Severini

Extending a recent breakthrough of Shitov, we prove that the chromatic number of the tensor product of two graphs can be a constant factor smaller than the minimum chromatic number of the two graphs. More precisely, we prove that there…

组合数学 · 数学 2020-03-17 Xiaoyu He , Yuval Wigderson

Carath\'eodory's conjecture has long been regarded as one of the central problems in the classical theory of convex surfaces. In this paper, we establish an index formula for hemispheres of convex closed surfaces under $C^2$-regularity. The…

微分几何 · 数学 2026-01-06 Naoya Ando , Masaaki Umehara

The chromatic number of $G\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.

组合数学 · 数学 2019-06-17 Yaroslav Shitov

In this work, we consider a finitely determined, quasihomogeneous, corank 1 map germ $f$ from $(\mathbb{C}^2,0)$ to $(\mathbb{C}^3,0)$. We introduce the concept of the $\mu_{\mathbf{m},\mathbf{k}}$-minimal transverse slice of $f$}. Since…

代数几何 · 数学 2025-10-14 Otoniel Nogueira da Silva , Manoel Messias da Silva Júnior

In this paper we prove the following results: $1)$ We show that any arithmetic quotient of a homogeneous space admits a natural real semi-algebraic structure for which its Hecke correspondences are semi-algebraic. A particularly important…

代数几何 · 数学 2020-06-24 Benjamin Bakker , Bruno Klingler , Jacob Tsimerman

We prove that the existence of best coapproximation to any element of the normed linear space out of any one dimensional subspace and its coincidence with the best approximation to that element out of that subspace characterizes a real…

泛函分析 · 数学 2024-07-30 Debmalya Sain , Kallol Paul , Lokenath Debnath
‹ 上一页 1 2 3 10 下一页 ›