中文
相关论文

相关论文: Cobounding odd cycle colorings

200 篇论文

A conjecture of Berkovich asserts that every non-simple finite p-group has a non-inner automorphism of order p. This conjecture is far from being proved despite the great effort devoted to it. In this paper we prove it for p-groups of…

群论 · 数学 2013-01-03 Yassine Guerboussa , Miloud Reguiat

In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…

组合数学 · 数学 2025-08-08 Gary Lazzaro , Max Wakefield , Jason Weiss

We give a sharp spectral condition for the existence of odd cycles in a graph of given order. We also prove a related stability result.

组合数学 · 数学 2007-11-22 Vladimir Nikiforov

We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it…

组合数学 · 数学 2018-12-05 Richard Behr

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

逻辑 · 数学 2020-03-30 Keegan Dasilva Barbosa

Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…

组合数学 · 数学 2025-01-31 Aida Abiad , Wieb Bosma , Thijs van Veluw

We start with a curve over an algebraically closed ground field of positive characteristic $p>0$. By using specialization techniques, under suitable natural coprimality conditions, we prove a cohomological Simpson Correspondence between the…

代数几何 · 数学 2022-03-01 Mark Andrea A. de Cataldo , Siqing Zhang

A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…

组合数学 · 数学 2013-07-11 Daniel Gonçalves , Aline Parreau , Alexandre Pinlou

It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $\Delta^{mon}(G)\leq n-3k+1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confirm this conjecture for $k=2$, prove several additional…

组合数学 · 数学 2017-08-30 Ruonan Li , Hajo Broersma , Shenggui Zhang

Cohen--Suciu proved that the cohomology ring of the boundary manifold of a complex projective line arrangement is isomorphic to the double of the cohomology ring of the complement. In this paper, we generalize this result to arbitrary…

几何拓扑 · 数学 2025-07-10 Sakumi Sugawara

In this paper, we give a method to evaluate minimum numbers of Dehn colors for knots by using symmetric local biquandle cocycle invariants. We give answers to some questions arising as a consequence of our previous paper [6]. In particular,…

几何拓扑 · 数学 2025-04-08 Eri Matsudo , Kanako Oshiro , Gaishi Yamagishi

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

逻辑 · 数学 2016-09-06 Saharon Shelah , Lee Stanley

The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…

组合数学 · 数学 2024-10-15 Lefteris Kirousis , John Livieratos

The main result of this note is an effective uniform bound for the number of deformation types of certain nonisotrivial families of canonically polarized manifolds. It extends the author's earlier such bound for the classical Shafarevich…

代数几何 · 数学 2010-06-21 Gordon Heier

Balanced colorings of networks classify robust synchrony patterns -- those that are defined by subspaces that are flow-invariant for all admissible ODEs. In symmetric networks the obvious balanced colorings are orbit colorings, where colors…

动力系统 · 数学 2021-06-30 Ian Stewart

We construct an action of a polynomial ring on the colored sl(2) link homology of Cooper-Krushkal, over which this homology is finitely generated. We define a new, related link homology which is finite dimensional, extends to tangles, and…

几何拓扑 · 数学 2014-05-13 Matt Hogancamp

A strong odd coloring of a simple graph $G$ is a proper coloring of the vertices of $G$ such that for every vertex $v$ and every color $c$, either $c$ is used an odd number of times in the open neighborhood $N_G(v)$ or no neighbor of $v$ is…

组合数学 · 数学 2024-10-04 Yair Caro , Mirko Petruševski , Riste Škrekovski , Zsolt Tuza

We consider low-dimensional systems with the shadowing property. In dimension two, we show that the shadowing property for a homeomorphism implies the existence of periodic orbits in every $\epsilon$-transitive class, and in contrast we…

动力系统 · 数学 2019-02-20 Andres Koropecki , Enrique R. Pujals

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…

几何拓扑 · 数学 2018-04-10 Louis H. Kauffman , Pedro Lopes

We give a proof of a conjecture of Lehrer and Shoji regarding the occurrences of the exterior powers of the reflection representation in the cohomology of Springer fibers. The actual theorem proved is a slight extension of the original…

表示论 · 数学 2011-06-22 Eric Sommers
‹ 上一页 1 8 9 10 下一页 ›