中文
相关论文

相关论文: Graphs and $({\Bbb Z}_2)^k$-actions

200 篇论文

For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of vertices of each color in its closed neighborhood is called…

组合数学 · 数学 2025-10-21 Maurice Almeida , Ravindra Pawar , Siddharth Gupta , Tarkeshwar Singh

In this paper we develop an equivariant intersection theory for actions of algebraic groups on algebraic schemes. The theory is based on our construction of equivariant Chow groups. They are algebraic analogues of equivariant cohomology…

alg-geom · 数学 2008-02-03 Dan Edidin , William Graham

A homomorphism of a signed graph $(G, \sigma)$ to $(H, \pi)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and the product of signs of closed walks are preserved.…

组合数学 · 数学 2021-01-22 Reza Naserasr , Riste Škrekovski , Zhouningxin Wang , Rongxing Xu

Let $G$ be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface $X \subseteq \mathbb{S}^2$. We prove that $G$ admits such an action that is in addition co-compact, provided we can…

组合数学 · 数学 2019-05-17 Agelos Georgakopoulos

A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $\Delta$, then the chromatic index $\chi'(G)$ of $G$ is $\Delta$ or $\Delta+1$. A graph $G$ is class 1 if $\chi'(G)=\Delta$, and class 2 if…

组合数学 · 数学 2021-09-02 Gang Chen , Zhengke Miao , Zi-Xia Song , Jingmei Zhang

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

组合数学 · 数学 2026-04-24 Veronica Bitonti , Emma Hogan , Tommy Walker Mackay

The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…

组合数学 · 数学 2018-09-25 Doost Ali Mojdeh , Babak Samadi , Lutz Volkmann

Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one…

计算复杂性 · 计算机科学 2016-03-02 Vít Jelínek , Eva Jelínková , Jan Kratochvíl

We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…

组合数学 · 数学 2024-09-27 Stijn Cambie , Jan Goedgebeur , Jorik Jooken

Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$…

计算机科学中的逻辑 · 计算机科学 2015-01-30 Andreas Krebs , Oleg Verbitsky

Let $(M,J)$ be a compact, connected, almost complex manifold of dimension $2n$ endowed with a $J$-preserving circle action with isolated fixed points. In this note we analyse the `geography problem' for such manifolds, deriving equations…

代数拓扑 · 数学 2016-02-16 Silvia Sabatini

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…

组合数学 · 数学 2024-11-07 Simona Boyadzhiyska , Richard Lang , Allan Lo , Michael Molloy

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

组合数学 · 数学 2024-12-11 Pu Gao , Yuval Ohapkin

We show that under standard assumptions on the isotropy groups of an integer GKM manifold, the equivariant Stiefel-Whitney classes of the action are determined by the GKM graph. This is achieved via a GKM-style description of the…

代数拓扑 · 数学 2024-01-02 Oliver Goertsches , Panagiotis Konstantis , Leopold Zoller

We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces…

组合数学 · 数学 2012-11-16 Alexander Schrijver

We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…

组合数学 · 数学 2019-10-01 Jaehoon Kim , Daniela Kühn , Andrey Kupavskii , Deryk Osthus

In the Euclidean $k$-means problems we are given as input a set of $n$ points in $\mathbb{R}^d$ and the goal is to find a set of $k$ points $C\subseteq \mathbb{R}^d$, so as to minimize the sum of the squared Euclidean distances from each…

计算几何 · 计算机科学 2024-05-24 Enver Aman , Karthik C. S. , Sharath Punna

Let G be a group acting on the plane by orientation-preserving homeomorphisms. We show that if for some k>0 there is a ball of radius r > k/\sqrt{3} such that each point x in the ball satisfies |gx -hx| < k for all g, h in G, and the action…

动力系统 · 数学 2014-10-01 Kathryn Mann

We develop a topological framework for proving lower bounds on sign-rank via $\mathbb{Z}_2$-equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance problem up to lower-order terms. For every (partial) sign…

组合数学 · 数学 2026-04-14 Florian Frick , Kaave Hosseini , Aliaksei Vasileuski

For a linear algebraic group $G$ over a field $k$, we define an equivariant version of the Voevodsky's motivic cobordism $MGL$. We show that this is an oriented cohomology theory with localization sequence on the category of smooth…

代数几何 · 数学 2012-06-27 Amalendu Krishna
‹ 上一页 1 8 9 10 下一页 ›