中文
相关论文

相关论文: Zero $A$-paths and the Erd\H{o}s-P\'osa property

200 篇论文

In this paper, we obtain a characterization of short normal sequences over a finite Abelian p-group, thus answering positively a conjecture of Gao for a variety of such groups. Our main result is deduced from a theorem of Alon, Friedland…

数论 · 数学 2012-05-28 Benjamin Girard

Let $ G $ be a connected, simply connected nilpotent Lie group and $ \Gamma < G $ a lattice. We prove that each ergodic diffeomorphism $ \phi(x\Gamma)=uA(x)\Gamma $ on the nilmanifold $ G/\Gamma $, where $ u\in G $ and $ A:G\to G $ is a…

We show that every finitely-generated non-amenable linear group over a field of characteristic zero admits an ergodic action which is rigid in the sense of Popa. If this group has trivial solvable radical, we prove that these actions can be…

动力系统 · 数学 2016-06-21 Mohamed Bouljihad

Let the matching polynomial of a graph $G$ be denoted by $\mu (G,x)$. A graph $G$ is said to be $\theta$-super positive if $\mu(G,\theta)\neq 0$ and $\mu(G\setminus v,\theta)=0$ for all $v\in V(G)$. In particular, $G$ is 0-super positive if…

组合数学 · 数学 2009-12-22 Cheng Yeaw Ku , Kok Bin Wong

We expose a class of discrete metric spaces, for which bounded geometry is equivalent to the property A of G. Yu. This class includes the coarse disjoint union of $(\mathbb Z/2\mathbb Z)^n$, $n\in\mathbb N$, and consists of spaces of simple…

度量几何 · 数学 2025-11-21 V. Manuilov

Erd\H{o}s and Gy\'arf\'as conjectured in 1994 that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs,…

组合数学 · 数学 2025-02-12 Anand Shripad Hegde , R. B. Sandeep , P. Shashank

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

We study two global structural properties of a graph $\Gamma$, denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erd\"os--R\'enyi random graph model G(n,p), proving a sharp…

概率论 · 数学 2020-01-29 Jason Behrstock , Victor Falgas-Ravry , Mark F. Hagen , Timothy Susse

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

组合数学 · 数学 2024-10-30 Sylwia Cichacz

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

离散数学 · 计算机科学 2023-10-23 Marcin Pilipczuk , Ni Luh Dewi Sintiari , Stéphan Thomassé , Nicolas Trotignon

In this paper, we show some splitting theorems for CAT(0) spaces on which a product group acts geometrically and we obtain a splitting theorem for compact geodesic spaces of non-positive curvature. A CAT(0) group $\Gamma$ is said to be {\it…

群论 · 数学 2010-05-25 Tetsuya Hosaka

We prove that the tropical Abel--Prym map $\Psi\colon \widetilde\Gamma\to Prym(\widetilde\Gamma/\Gamma)$ associated with a free double cover $\pi\colon \widetilde\Gamma\to \Gamma$ of hyperelliptic metric graphs is harmonic of degree $2$ in…

代数几何 · 数学 2025-08-25 Giusi Capobianco , Yoav Len

The Erd\H{o}s-Gy\'{a}rf\'{a}s conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the…

The power graph denoted by $\mathcal{P}(\mathcal{G})$ of a finite group $\mathcal{G}$ is a graph with vertex set $\mathcal{G}$ and there is an edge between two distinct elements $u, v \in \mathcal{G}$ if and only if $u^m = v$ or $v^m = u$…

组合数学 · 数学 2022-12-26 Yogendra Singh , Anand Kumar Tiwari , Fawad Ali

This paper studies the problem of testing if an input (Gamma,*), where Gamma is a finite set of unknown size and * is a binary operation over Gamma given as an oracle, is close to a specified class of groups. Friedl et al. [Efficient…

数据结构与算法 · 计算机科学 2021-10-05 Francois Le Gall , Yuichi Yoshida

In this paper we study various rigidity aspects of the von Neumann algebra $L(\Gamma)$ where $\Gamma$ is a graph product group \cite{Gr90} whose underlying graph is a certain cycle of cliques and the vertex groups are the wreath-like…

算子代数 · 数学 2025-06-03 Ionut Chifan , Michael Davis , Daniel Drimbe

A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the…

组合数学 · 数学 2010-01-24 Konstantin Rybnikov , Thomas Zaslavsky

In this short note we answer a query of Brodzki, Niblo, \v{S}pakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the second result of the note recall that Kaiser proved that…

度量几何 · 数学 2021-04-20 Gábor Elek

For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…

组合数学 · 数学 2025-10-14 Gabe Cunningham , Igor Minevich

We investigate eigenvalues of the zero-divisor graph $\Gamma(R)$ of finite commutative rings $R$ and study the interplay between these eigenvalues, the ring-theoretic properties of $R$ and the graph-theoretic properties of $\Gamma(R)$. The…

组合数学 · 数学 2019-10-29 Katja Mönius